2-Tree.E
Edges are ORDERED_TYPE.
ORDERED_TYPE
type t
val compare : t -> t -> int
Edges are directed.
type vertex = V.t
val src : t -> vertex
Edge origin.
val dst : t -> vertex
Edge destination.
Edges are labeled.
type label = unit
val create : vertex -> label -> vertex -> t
create v1 l v2 creates an edge from v1 to v2 with label l
create v1 l v2
v1
v2
l
val label : t -> label
Get the label of an edge.