Algorithm | js-incremental-cycle-detect

Some common methods and algorithms that are not specific to a graph data structure implementation.

Hierarchy

Algorithm

Index

Methods

Methods

Static findWeaklyConnectedComponents

findWeaklyConnectedComponents<TVertex, TEdgeData>(graph: CommonAdapter<TVertex, TEdgeData>, setConstructor?: SetConstructor): WeaklyConnectedComponent<TVertex, TEdgeData>[]

- Defined in Algorithm.ts:15
Finds all weakly connected components of the graph.

Type parameters
- TVertex
- TEdgeData
Parameters
- graph: CommonAdapter<TVertex, TEdgeData>
  
  Graph data structure to use.
- Default value setConstructor: SetConstructor = Set
  
  Optional Set implementation.
Returns WeaklyConnectedComponent<TVertex, TEdgeData>[]

The weakly connected components of the given graph.

Static getNeighbors

getNeighbors<TVertex>(graph: CommonAdapter<TVertex>, vertex: TVertex): Iterator<TVertex>

- Defined in Algorithm.ts:63
Returns an iterator over the given vertices predecessors and successors, in that order.

Type parameters
- TVertex
Parameters
- graph: CommonAdapter<TVertex>
  
  A graph data structure.
- vertex: TVertex
  
  Vertex whose predecessors and successors are fetched.
Returns Iterator<TVertex>

The vertex's predecessors and successors in that order.

Generated using TypeDoc