commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Marco Speranza <>
Subject [Graph] Kruskal's algorithm doesn't accept sparse graph
Date Mon, 30 Jan 2012 22:38:40 GMT
Hi guys,

I found a little problem into Kruskal's algorithm when the input graph is not connected and/or
 it's a graph without the edges.
I created  atest case that produces this error:

Running org.apache.commons.graph.spanning.KruskalTestCase
Tests run: 2, Failures: 0, Errors: 1, Skipped: 0, Time elapsed: 0.096 sec <<< FAILURE!
Time elapsed: 0.007 sec  <<< ERROR!
       at java.util.AbstractQueue.remove(
       at org.apache.commons.graph.spanning.DefaultSpanningTreeAlgorithmSelector.applyingKruskalAlgorithm(

I created a issue into Jira (SANDBOX-374)  and I attached a patch that resolves the problem.

heve a nice day :)

Marco Speranza <>

Google Code:

View raw message