module Digraph:Imperative Directed Graphs implemented with adjacency matricesS
0..n-1
.
A vertex label is the vertex itself.
Edges are unlabeled.include Sig.I
val make : int -> t
create
is useless (creates an empty graph); use make
instead.add_vertex
and remove_vertex
have no effect