the nodes of the directed graph
each node's outgoing edges
each node's outgoing edges
Gets the outgoing edges for the specified node.
Gets the outgoing edges for the specified node.
the node of interest
the outgoing edges for the specified node
the nodes of the directed graph
The sinks of the graph (i.e.
The sinks of the graph (i.e. nodes with no outgoing edges).
Converts this directed graph into a position tree.
Converts this directed graph into a position tree.
Note: this is a recursive function. It will throw an exception if the graph is cyclic.
index corresponding to the node you want to be the root of the tree
this graph, as a position tree
A directed graph.
The index of a node is its position in the
nodes
list (counting from 0).the nodes of the directed graph
each node's outgoing edges