Module Tree.E

Edges have type E.t and are labeled with type E.label. src (resp. dst) returns the origin (resp. the destination) of a given edge.

Edges are ORDERED_TYPE.

type t
val compare : t -> t -> int

Edges are directed.

type vertex = vertex
val src : t -> vertex

Edge origin.

val dst : t -> vertex

Edge destination.

Edges are labeled.

type label
val create : vertex -> label -> vertex -> t

create v1 l v2 creates an edge from v1 to v2 with label l

val label : t -> label

Get the label of an edge.