Index of modules

2^31-bounded digraphs.

Traversal algorithms with tree construction.

Heap implementation in a vector.

Tables of ints (to store a numbering of vertices for example).

n-bounded Digraphs with multiple edges.

Index digraphs with int labels on nodes and edges.

Indexed diraphs with labels, vertex labels are mapped to indexes.

Vectors from usual arrays.

Vectors with gaps from usual arrays.

Get a Vector from an Array.

Queue implementation in a vector.

Minimal signatures for graph algorithms provided by BigGraph.

Skeleton construction of a graph.

Stack implementation in a vector.

In a graph traversal, each node is numbered (first node visited: 0, second node: 1, ...), has eventually a parent (the ndoe from which it was discovered, the starting node(s) of the traversal are their own parent, the parent information thus induces a forest), and a distance information (the length of parent chain up to a source node).

Traversal algorithms with tree construction.

Digraphs without any label.

Tables of vertices (to store parent of each vertex for example).

Dynamic arrays.

Manipulate labels as weights.

Tables of weights (to store weighted distances for example).