[jira] [Resolved] (SANDBOX-335) [Graph] Graph Coloring: Backtracking algorithm

["Simone Tripodi (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/SANDBOX-335?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Simone Tripodi resolved SANDBOX-335.
------------------------------------

    Resolution: Fixed
      Assignee: Simone Tripodi

The patch looks like much much better, thanks :)
Applied on [r1142948|http://svn.apache.org/viewvc?view=revision&revision=1142948]

As a next step, I suggest you modifying the colors as parametric {{Comparable}}s instead of just {{Integer}}s, so the algorithms are enough adaptable for heterogeneous cases ;)

Open a new Issue if you intend working on it!

> [Graph] Graph Coloring: Backtracking algorithm
> ----------------------------------------------
>
>                 Key: SANDBOX-335
>                 URL: https://issues.apache.org/jira/browse/SANDBOX-335
>             Project: Commons Sandbox
>          Issue Type: Improvement
>          Components: Graph
>            Reporter: Marco Speranza
>            Assignee: Simone Tripodi
>            Priority: Minor
>         Attachments: GraphColoring-BackTrackingAlgo-Added-Set.patch, 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: http://www.atlassian.com/software/jira