Detect Tight Communities in a social Network
-
Updated
Aug 7, 2019 - Scala
Detect Tight Communities in a social Network
Implementation of Bron-Kerbosch algorithm to find maximal cliques in an undirected graph of a particular case at the Graph Theory and Application course @ University of Brasilia
Add a description, image, and links to the kerbosch topic page so that developers can more easily learn about it.
To associate your repository with the kerbosch topic, visit your repo's landing page and select "manage topics."