almete.bronkerbosch
Advanced tools
Readme
almete.BronKerbosch(edges)
Implementation of Bron-Kerbosch algorithm to find maximal cliques in an undirected graph. This algorithm variant uses pivoting and a modification developed by Tomita.
| argument | description |
|---|---|
edges | An iterable of edges to build the graph from. An edge is an array of two nodes. |
Returns maximal cliques as an array of arrays.
no dependencies
let edges = [[6, 4], [4, 3], [4, 5], [5, 2], [5, 1], [1, 2]];
let cliques = almete.BronKerbosch(edges);
// => [[4, 6], [4, 3], [4, 5], [2, 5, 1]]
The package can be installed via npm and used as a Node.js module.
const BronKerbosch = require('almete.BronKerbosch');
FAQs
Implementation of Bron-Kerbosch algorithm to find maximal cliques in an undirected graph.
We found that almete.bronkerbosch demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Ransomware costs victims an estimated $30 billion per year and has gotten so out of control that global support for banning payments is gaining momentum.
Application Security
New SEC disclosure rules aim to enforce timely cyber incident reporting, but fear of job loss and inadequate resources lead to significant underreporting.
Security News
The Python Software Foundation has secured a 5-year sponsorship from Fastly that supports PSF's activities and events, most notably the security and reliability of the Python Package Index (PyPI).