Creates an instance of DepthFirstOrder
for given digraph.
digraph to build the order.
implementation of DepthFirstOrder.
Creates new instance of Digraph.
new instance of Digraph.
Creates an instance of DigraphSearch
that makes Breadth First Search.
BFS instance.
Creates an instance of DigraphSearch
that makes Depth First Search.
DFS instance.
Creates new Digraph with given egdes.
edges to add into new digrapth.
new Digraph with given egdes.
Creates new instance of Digraph from given keys of its edges. It means that for every pair like ['key1', 'key2'] it creates pair of vertices [V1('key1', 'key1'), V2('key2', 'key2'] and adds this pair of vertices as the edge (V1->V2).
pairs of keys of vertices that describe edges.
new digraph with given edges.
Creates an instance of Directed
for give digraph.
digraph to build the Directed instance.
source vertices.
implementation of Directed.
Creates new DirectedCycle that analyzes given digraph.
digraph to analyse.
new DirectedCycle that analyzes given digraph.
Creates an instance of DirectedEulerianCycle
for give digraph.
digraph to build the order.
implementation of DirectedEulerianCycle.
Creates an instance of DirectedEulerianPath
for give digraph.
digraph to build the order.
implementation of DirectedEulerianPath.
Creates BFS-based implementation of DirectedPaths for given digraph and sources.
BFS-based implementation of DirectedPaths.
Creates DFS-based implementation of DirectedPaths for given digraph and sources.
DFS-based implementation of DirectedPaths.
Creates an instance of StronglyConnectedComponents
implementation that uses Gabow algorithm.
digraph to build the order.
implementation of StronglyConnectedComponents.
Creates an instance of StronglyConnectedComponents
implementation that uses Kosaraju-Sharir
algorithm.
digraph to build the order.
implementation of StronglyConnectedComponents.
Creates an instance of StronglyConnectedComponents
implementation that uses Tarjan algorithm.
digraph to build the order.
implementation of StronglyConnectedComponents.
Creates an instance of TopologicalOrder
for give digraph.
digraph to build the order.
implementation of TopologicalOrder.
Creates an instance of TransitiveClosure
for give digraph.
digraph to build the closure.
implementation of TransitiveClosure.
Creates new vertex with given key and with value === key.
key of the creating vertex.
vertex with value === key.
Creates new vertex with given key and payload.
key.
payload.
new vertex.
Generated using TypeDoc
Factory functions for creating instances of graphs' ADTs.