gramoloss
Version:
Graph theory package for edition and computation
11 lines (7 loc) • 575 B
text/typescript
import { Graph } from "../graph";
console.log(Graph.fromEdges([[0,1],[1,2],[3,4],[4,5]]).sizeConnectedComponentOf(0) == 3);
console.log(Graph.fromEdges([[0,1],[1,2],[3,4],[4,5]]).sizeConnectedComponentOf(1) == 3);
console.log(Graph.fromEdges([[0,1],[1,2],[3,4],[4,5]]).sizeConnectedComponentOf(3) == 3);
console.log(Graph.fromEdges([[0,1],[1,2],[2,0], [3,4]]).sizeConnectedComponentOf(0) == 3);
console.log(Graph.fromEdges([[0,1],[1,2],[2,3],[2,4],[1,5]]).sizeConnectedComponentOf(1) == 6);
console.log(Graph.fromEdges([[0,1],[1,2],[2,3],[2,4],[1,5]]).maxCutEdge() == 1);