Bron–Kerbosch algorithm implementation for finding maximal cliques in an undirected graph with OpenGL visualization
Statistics for this project are still being loaded, please check back later.
A tool for parallel and distributed enumeration of cliques and diameter two kplexes.
Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining ...
Solutions to Introduction to Algorithms
A general-purpose lightweight C++ graph library