The standard library Digraph_Strongly_Connected_Components api defines access to functionality for finding strongly connected components in directed graphs.
Packages implementing the Digraph_Strongly_Connected_Components api may be generated using the src/lib/src/digraph-strongly-connected-components-g.pkg generic.
The Digraph_Strongly_Connected_Components api source code is in src/lib/src/digraph-strongly-connected-components.api.
The above information is manually maintained and may contain errors.
api { package nd
: api {
Key;
compare : (Key , Key) -> Order;};;
Node = nd::Key;
Component = RECURSIVE List(Node ) | SIMPLE Node;
topological_order' : {follow:Node -> List(Node ), roots:List(Node )} -> List(Component );
topological_order : {follow:Node -> List(Node ), root:Node} -> List(Component );};