module Digraph:Imperative Directed Graphs implemented with adjacency matrices.S
0..n-1
.
A vertex label is the vertex itself.
Edges are unlabeled.include Sig.I
val make : int -> t
make
must be used instead of create
.add_vertex
and remove_vertex
have no effect.