You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by "Marco Speranza (JIRA)" <ji...@apache.org> on 2011/07/01 19:06:28 UTC

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

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

Marco Speranza updated SANDBOX-335:
-----------------------------------

    Attachment: GraphColoring-BackTrackingAlgo.patch

here is the patch. thanks all guys :-)

> [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
>            Priority: Minor
>         Attachments: GraphColoring-BackTrackingAlgo.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