[
https://issues.apache.org/jira/browse/SANDBOX-349?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13875745#comment-13875745
]
Rogério Theodoro de Brito commented on SANDBOX-349:
---------------------------------------------------
Hi there.
Just to test the waters (and to learn some Java), I have implemented two simple
test cases for Dijkstra's algorithm, essentially mimic'ing what was already
done in the previous examples. Please, be gentle with me, as this is my first
Java programming since the times of JDK1.1 (and I have a bunch of new syntax to
catch up with).
Thanks,
Rogério Brito.
> Verify Prim's and Kruskal's algorithms correctness
> --------------------------------------------------
>
> Key: SANDBOX-349
> URL: https://issues.apache.org/jira/browse/SANDBOX-349
> Project: Commons Sandbox
> Issue Type: Sub-task
> Components: Graph
> Reporter: Simone Tripodi
> Attachments: 0001-test-Add-test-for-Kruskal-s-MST-algorithm.patch,
> 0002-test-Add-test-for-Kruskal-s-MST-algorithm.patch
>
>
> The package {{org.apache.commons.graph.spanning}} contains
> [Kruskal|http://en.wikipedia.org/wiki/Kruskal's_algorithm]'s and
> [Prim|http://en.wikipedia.org/wiki/Prim%27s_algorithm]'s algorithms
> implementation (with testcases) that need to be verified in their correctness
--
This message was sent by Atlassian JIRA
(v6.1.5#6160)
