CODEWITHSUNDEEP
algorithmgraph-theory
Paddy3118
Paddy3118

Reputation: 4772

Selecting objects to satisfy a requirements chain

I have nodes each of which can generate and/or consume typed resources. Given a particular node, I want to generate any/all directed graphs of nodes starting from nodes that consume nothing that ultimately satisfy all the resource requirements of the particular node (and the requirements of all other nodes in the graph too).

Trivial Example:

A generates r1
B generates r2 and r3
C generates r3 and r4 and consumes r1
D consumes r4
...

To make D I could use the graph A -> C -> D

There could be more than one way of making D. The problem is similar to, but not that solved by topological sorting.

I am after some names for this problem that I can research.

Thanks.

Upvotes: 0

Views: 34

Answers (1)

Paddy3118
Paddy3118

Reputation: 4772

So far, I have "Program evaluation and review technique" as a subject to review.

Upvotes: 0

Related Questions