Name Rascal/Libraries/analysis/graphs/Graph/order

Synopsis Compute topological order of the nodes in a graph.

Function list[&T] order(Graph[&T] g)

Usage import analysis::graphs::Graph;

Examples

rascal>import  analysis::graphs::Graph;
ok
rascal>order({<3,4>, <1,2>, <2,4>, <1,3>});
list[int]: [1,2,3,4]

[Edit] | [New Subconcept] | [Recompile Course] | [Warnings]