Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions
Content added Content deleted
No edit summary |
(Suggest new task: implement Bron-Kerbosch algorithm for finding maximal cliques in an undirected graph.) |
||
| Line 752: | Line 752: | ||
Gaming example: random treasure generation in roguelikes. I've found that this is extremely awkward to do in some languages, and simple in others. |
Gaming example: random treasure generation in roguelikes. I've found that this is extremely awkward to do in some languages, and simple in others. |
||
== Partitioning == |
=== Partitioning === |
||
Task for "partition an integer into X primes". For example, partition 19 into 3 primes could return 3+5+11. |
Task for "partition an integer into X primes". For example, partition 19 into 3 primes could return 3+5+11. |
||
| Line 768: | Line 768: | ||
-- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 03:48, 3 March 2017 (UTC) |
-- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 03:48, 3 March 2017 (UTC) |
||
=== Bron-Kerbosch algorithm === |
|||
Implement any of the variants of the 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. |
|||
==Insufficient information== |
==Insufficient information== |
||