QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's
- by Greg
Hi,
In QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's. In other words all vertex's which have somewhere under them (on the way to the leaf nodes) one or more of the vertexs input. So if the vertexs were Nodes, and the edges were a depends on relationship, find all nodes that would be impacted by a given set of nodes.
If not how hard is it to write one's own algorithms?