Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions
Content added Content deleted
(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: | Line 770: | ||
=== Bron-Kerbosch algorithm === |
=== Bron-Kerbosch algorithm === |
||
Implement any of the variants of the Bron-Kerbosch algorithm for finding maximal cliques (maximal complete subgraphs) in an undirected graph |
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. |
||
This should likely be sorted under 1.2.2.1, Graph algorithms. |
This should likely be sorted under 1.2.2.1, Graph algorithms. |
||