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

Posted to issues@commons.apache.org by "Simone Tripodi (JIRA)" <ji...@apache.org> on 2011/06/28 14:22:17 UTC

[jira] [Resolved] (SANDBOX-333) Graph coloring implementation

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

Simone Tripodi resolved SANDBOX-333.
------------------------------------

    Resolution: Fixed
      Assignee: Simone Tripodi

your patch has been successfully applied, thanks for such great contribution! see [r1140557|http://svn.apache.org/viewvc?view=revision&revision=1140557]

> Graph coloring implementation
> -----------------------------
>
>                 Key: SANDBOX-333
>                 URL: https://issues.apache.org/jira/browse/SANDBOX-333
>             Project: Commons Sandbox
>          Issue Type: Improvement
>          Components: Graph
>            Reporter: Marco Speranza
>            Assignee: Simone Tripodi
>            Priority: Minor
>         Attachments: GraphColoring.patch
>
>
> Hi all, I just implemented a simple version of graph coloring problem. 
> This implementation contains the chromatic number ( is the minimal number of colors needed to color each vertex such that no two adjacent vertices share the same color) and also the coloring algorithm.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira