[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

On 25 September 2017 at 14:23, Ian Kelly <ian.g.kelly at gmail.com> wrote: > You have a DAG, so you can sort it topologically. Then you can process > it in that order so that everything that uses X will be processed > before X so that when you get to X you'll know exactly how much of it > you need and you don't have to worry about "feedback". For actual > production, run through it in the opposite order so that you'll > produce all your precursors before the things that require them. Hmm, yes that makes sense. I was thinking of a topological sort in the other direction (ingredient before product) and that way round doesn't work. For some reason, when thinking about topological sorts, I tend to get fixated on one direction and forget they are actually reversible... Paul

- Prev by Date:
**[Tutor] beginning to code** - Next by Date:
**Call by binding [was Re: [Tutor] beginning to code]** - Previous by thread:
**Looking for an algorithm - calculate ingredients for a set of recipes** - Next by thread:
**Looking for an algorithm - calculate ingredients for a set of recipes** - Index(es):