Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
-
Updated
Mar 31, 2017 - C++
Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
Add a description, image, and links to the maximal-cliques-finding topic page so that developers can more easily learn about it.
To associate your repository with the maximal-cliques-finding topic, visit your repo's landing page and select "manage topics."