UNPKG

gramoloss

Version:

Graph theory package for edition and computation

23 lines (22 loc) 869 B
"use strict"; // Clique Number unit tests Object.defineProperty(exports, "__esModule", { value: true }); const graph_1 = require("../graph"); // w(Pm) = 2 if m >= 1 console.log("Test paths"); for (let i = 3; i < 8; i++) { console.log(graph_1.Graph.path(i).cliqueNumber() == 2); } // w(Kn) = n console.log("Test cliques"); for (let i = 3; i < 8; i++) { console.log(graph_1.Graph.clique(i).cliqueNumber() == i); } // p(C5) = 2 console.log(graph_1.Graph.fromEdges([[0, 1], [1, 2], [2, 3], [3, 4], [4, 0]]).cliqueNumber() == 2); // p(K33) = 2 console.log(graph_1.Graph.fromEdges([[0, 1], [0, 3], [0, 5], [2, 1], [2, 3], [2, 5], [4, 1], [4, 3], [4, 5]]).cliqueNumber() == 2); // Paley graphs console.log(graph_1.Graph.Paley(5).cliqueNumber() == 2); console.log(graph_1.Graph.Paley(13).cliqueNumber() == 3); console.log(graph_1.Graph.Paley(17).cliqueNumber() == 3);