gramoloss
Version:
Graph theory package for edition and computation
18 lines (12 loc) • 395 B
text/typescript
// const g = generatePaleyGraph(7);
// const n = 20;
// // const g = generateUGTournament(n,0);
// const g = generateAcyclicTournament(n);
// for (let i = 0; i < 100; i ++){
// if (g.isTournamentLight()){
// console.log(g.dichromaticNumber());
// }
// }
// console.log(g.dichromaticNumber())
// console.log(g.isTournamentLight())
// console.log(tournamentLightConflict(g));