Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions

m
Added link to Wikipedia in the right format
(Suggest new task: implement Bron-Kerbosch algorithm for finding maximal cliques in an undirected graph.)
m (Added link to Wikipedia in the right format)
Line 770:
 
=== Bron-Kerbosch algorithm ===
Implement any of the variants of the [[wp:Bron-Kerbosch_algorithm|Bron-Kerbosch algorithm]] for finding maximal cliques (maximal complete subgraphs) in an undirected graph. See [https://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm].
 
This should likely be sorted under 1.2.2.1, Graph algorithms.
Anonymous user