package ocamlgraph

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

Imperative graphs implemented as adjacency matrices.

module type S = sig ... end

Vertices are integers in 0..n-1. A vertex label is the vertex itself. Edges are unlabeled.

module Digraph : S

Imperative Directed Graphs implemented with adjacency matrices.

module Graph : S

Imperative Undirected Graphs implemented with adjacency matrices.