acgtk.magicRewriting
Rg_graph.V
Vertices have type V.t and are labeled with type V.label (note that an implementation may identify the vertex with its label)
V.t
V.label
Vertices are COMPARABLE.
COMPARABLE
acgtk.acgData
acgtk.containers
acgtk.datalogLib
acgtk.dump
acgtk.grammars
acgtk.logic
acgtk.scripting
acgtk.svg_rendering
acgtk.utilsLib
type t = vertex
include Graph.Sig.COMPARABLE with type t := t
val compare : t -> t -> int
val hash : t -> int
val equal : t -> t -> bool
Vertices are labeled.
type label
val create : label -> t
val label : t -> label