gramoloss
Version:
Graph theory package for edition and computation
10 lines (9 loc) • 745 B
JavaScript
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
const graph_1 = require("../graph");
console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [3, 4], [4, 5]]).sizeConnectedComponentOf(0) == 3);
console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [3, 4], [4, 5]]).sizeConnectedComponentOf(1) == 3);
console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [3, 4], [4, 5]]).sizeConnectedComponentOf(3) == 3);
console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [2, 0], [3, 4]]).sizeConnectedComponentOf(0) == 3);
console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [2, 3], [2, 4], [1, 5]]).sizeConnectedComponentOf(1) == 6);
console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [2, 3], [2, 4], [1, 5]]).maxCutEdge() == 1);