module Imperative: sig .. end
Imperative Implementations
module type S = sig .. end
Signature of imperative graphs
Imperative Directed Graphs
module Digraph: sig .. end
module Graph: S
Imperative Undirected Graphs
module Matrix: sig .. end
Imperative graphs implemented as adjacency matrices
Faster implementations for abstract (un)labeled (di)graphs
when vertices are _not shared_ between different graphs.
This means that, when using the following implementations, two different
graphs (created with two calls to create) must have disjoint sets of
vertices.