[
https://issues.apache.org/jira/browse/SANDBOX-333?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13056433#comment-13056433
]
Marco Speranza commented on SANDBOX-333:
----------------------------------------
Great Simo, it makes sense I agree with you, it is usefull a getDegre method
into Graph.
tnx for your comment
have fun!
> 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
