commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Rogério Theodoro de Brito (JIRA) <>
Subject [jira] [Commented] (SANDBOX-349) Verify Prim's and Kruskal's algorithms correctness
Date Sat, 18 Jan 2014 20:44:19 GMT


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


Rogério Brito.

> Verify Prim's and Kruskal's algorithms correctness
> --------------------------------------------------
>                 Key: SANDBOX-349
>                 URL:
>             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|'s_algorithm]'s
and [Prim|]'s algorithms implementation (with
testcases) that need to be verified in their correctness

This message was sent by Atlassian JIRA

View raw message