GraphNumbering offers a facility for discovering and numbering the reachable vertices in a finite directed graph.
Make(M)(G) produces a numbering of the graph G, or more precisely, of the subset of the vertices of G that are reachable from the roots. The type of the vertices must be equipped with an implementation of imperative maps.
ForOrderedType is a special case of Make where it suffices for the vertices of G to be ordered.
module ForOrderedType (T : Map.OrderedType) (G : sig ... end) : sig ... endForHashedType is a special case of Make where it suffices for the vertices of G to be hashed.
module ForHashedType (T : Hashtbl.HashedType) (G : sig ... end) : sig ... endForType is a special case of Make where the vertices of G can have arbitrary type. OCaml's built-in generic equality and hash functions are used.