gramoloss/src/tests/generators.ts

Graph theory package for edition and computation

// Complete Multipartite Graph

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

{
    const g = Graph.completeMultipartite([4,3,2]);
    console.log(g.vertices.size == (4+3+2));
    console.log(g.links.size == (4*(3+2) + 3*(4+2) + 2*(4+3))/2)



}





// undirected: 5 13 17
// directed: 3 7 11

// in undirected, d = (q-1)/2
// in directed, d+ = d- = (q-1)/2

let q = 7;
const paley = Graph.Paley(q);

console.log(paley.vertices.size, q);
console.log(paley.links.size, q*(q-1)/4); // if undirected
console.log(paley.links.size, q*(q-1)/2); // if directed


// V(U(n)) = n
// A(U(n)) = binom(n,2)
// the in-degree or out-degree sequence of a UTournament(n)
// is 1 1 2 3 4 ... (n-2) (n-1) (n-1)
const n = 6;
const utourn = Graph.UGtournament(n,1);
console.log(utourn.vertices.size)
console.log(utourn.links.size)
for (const v of utourn.vertices.values()){
    console.log(v.outdegree())
}