package ocaml-protoc

Node in a graph, each node is identified using a unique int id

Graph.

create_node id sub create a node uniquely identified with id and connections to other nodes in sub.

The client application is responsible to ensure that the graph is consistent, by adding all nodes identified in sub to the same graph later.

empty_graph () create a new empty graph.

add_node node graph add node to graph

tarjan graph compute the ordered list of strongly connected components of a graph.

The returned list is order in decreasing order of dependencies. This means the last component of the list does not link to any other components.