gramoloss/src/tests/strongly_connected_components.ts

Graph theory package for edition and computation

import { Graph } from "../graph";

const g0 = Graph.fromArcs([[0, 1]]);
console.log(g0.stronglyConnectedComponents().length == 2);

const g1 = Graph.fromArcs([[0, 1], [1, 2]]);
console.log(g1.stronglyConnectedComponents().length == 3);

const g2 = Graph.fromArcs([[0,1],[1,2],[2,0],[3,2],[3,4],[4,5],[5,3]]);
console.log(g2.stronglyConnectedComponents().length == 2)

const g3 = Graph.fromArcs([[0,1],[1,2],[2,0]]);
console.log(g3.stronglyConnectedComponents().length == 1)

const g4 = Graph.fromArcs([[0,1],[1,2],[2,3],[3,0],[3,1],[1,4],[4,5],[5,3]]);
console.log(g4.stronglyConnectedComponents().length == 1);