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/06/28 00:59:57 UTC

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

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

Marco Speranza updated SANDBOX-333:
-----------------------------------

    Attachment: GraphColoring.patch

here is my patch

> 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
>            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