package ocamlgraph

  1. Overview
  2. Docs
package ocamlgraph
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Graph.PathSource

Paths

Sourcemodule type G = sig ... end

Minimal graph signature for Dijkstra's algorithm. Sub-signature of Sig.G.

Sourcemodule Dijkstra (G : G) (W : Sig.WEIGHT with type edge = G.E.t) : sig ... end
Sourcemodule BellmanFord (G : G) (W : Sig.WEIGHT with type edge = G.E.t) : sig ... end
Sourcemodule type WJ = sig ... end

Weight signature for Johnson's algorithm.

Sourcemodule Johnson (G : G) (W : WJ with type edge = G.E.t) : sig ... end
Sourcemodule Check (G : sig ... end) : sig ... end

Check for a path.

0-1 BFS

When edge weights are limited to 0 or 1, this is more efficient than running Dijkstra's algorithm. It runs in time and space O(E) in the worst case.

Sourcemodule Bfs01 (G : sig ... end) : sig ... end