Find All Possible Recipes from Given Supplies

Craft-game helper. You start with endless stocks of a few raw supplies, and each recipe turns its ingredients into one new item. An ingredient is a raw supply or the item another recipe makes, so recipes can build on each other. Two recipes that need each other, directly or through others, can never be made. Return the name of every recipe you can make, in any order. Details: recipes[i] needs every name in ingredients[i]. Once an item can be made you have as much of it as you like. A name may be listed twice in one recipe, and a recipe may be listed before the recipes it depends on. Limits: 1 <= recipes.length <= 50000, 1 <= supplies.length <= 50000, every recipe lists at least one ingredient, at most 200000 ingredient entries in all. Names are 1 to 10 lowercase letters or digits. Recipe names are distinct and never appear in supplies. A chain of recipes can be tens of thousands long, so avoid recursion. Example: supplies = [wood, iron, string] recipes = [bow, hammer, plank, nail, trap] ingredients = [[plank, string], [plank, nail], [wood], [iron], [gold, hammer]] => plank, nail, hammer, bow (in any order) plank and nail come straight from the supplies, then hammer and bow follow. trap needs gold, which is neither a supply nor a recipe. The stub returns a placeholder name, so an untouched stub never passes.