···73 standard concrete directional graphs. But accessing predecessors and
74 removing a vertex are faster. *)
7576- (** Imperative Unlabeled, bidirectional graph. *)
77 module ConcreteBidirectional (V: COMPARABLE) :
78 Sig.P with type V.t = V.t and type V.label = V.t and type E.t = V.t * V.t
79 and type E.label = unit
8081- (** Imperative Labeled and bidirectional graph. *)
82 module ConcreteBidirectionalLabeled(V:COMPARABLE)(E:ORDERED_TYPE_DFT) :
83 Sig.P with type V.t = V.t and type V.label = V.t
84 and type E.t = V.t * E.t * V.t and type E.label = E.t
···73 standard concrete directional graphs. But accessing predecessors and
74 removing a vertex are faster. *)
7576+ (** Persistent Unlabeled, bidirectional graph. *)
77 module ConcreteBidirectional (V: COMPARABLE) :
78 Sig.P with type V.t = V.t and type V.label = V.t and type E.t = V.t * V.t
79 and type E.label = unit
8081+ (** Persistent Labeled and bidirectional graph. *)
82 module ConcreteBidirectionalLabeled(V:COMPARABLE)(E:ORDERED_TYPE_DFT) :
83 Sig.P with type V.t = V.t and type V.label = V.t
84 and type E.t = V.t * E.t * V.t and type E.label = E.t