Class StronglyConnected<K>

The strongly connected components of a graph whose successors are asked for only once a node is reached (Tarjan's algorithm, iterative).

Type Parameters

K

Index

Constructors

Methods

Constructors

constructor

new StronglyConnected<K>(
    next: (node: K) => Iterable<K>,
    onComplete: (
        members: readonly K[],
        successorsOf: (member: K) => readonly K[],
    ) => void,
): StronglyConnected<K>
Type Parameters
- K
Parameters
- next: (node: K) => Iterable<K>
  the nodes a node leads to, asked for once per node
- onComplete: (members: readonly K[], successorsOf: (member: K) => readonly K[]) => void
  called with the members of each component once all components it leads to are complete
Returns StronglyConnected<K>
- Defined in src/util/fixpoint.ts:22

Methods

visit

visit(start: K): void
Completes the component of start and every component it leads to.
Parameters
- start: K
Returns void
- Defined in src/util/fixpoint.ts:28