commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Marco Speranza (JIRA)" <>
Subject [jira] [Commented] (SANDBOX-335) [Graph] Graph Coloring: Backtracking algorithm
Date Sun, 03 Jul 2011 21:27:21 GMT


Marco Speranza commented on SANDBOX-335:

Ciao Simo,

so, could it be a generic Collection or there is some restriction that makes List better for
the algorithm?

I used List for user Collections.shuffle method, it is useful. 


> [Graph] Graph Coloring: Backtracking algorithm
> ----------------------------------------------
>                 Key: SANDBOX-335
>                 URL:
>             Project: Commons Sandbox
>          Issue Type: Improvement
>          Components: Graph
>            Reporter: Marco Speranza
>            Priority: Minor
>         Attachments: GraphColoring-BackTrackingAlgo-Fixed.patch, GraphColoring-BackTrackingAlgo-Snd-Fixed.patch,
> Here is an little enhancement for graph coloring problem. I implemented an bruteforce
algorithm that uses the backtracking technique to find the exact solution for the m-coloring
problem (m is the maximum number of usable colors).  

This message is automatically generated by JIRA.
For more information on JIRA, see:


View raw message