QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's
Posted
by Greg
on Stack Overflow
See other posts from Stack Overflow
or by Greg
Published on 2010-04-27T05:59:16Z
Indexed on
2010/04/27
6:03 UTC
Read the original article
Hit count: 231
quickgraph
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?
© Stack Overflow or respective owner