When I use this function (getNeighboursAtMostKHops), I get the following error.
Exception in thread "main" java.lang.IllegalArgumentException: this set doesn't contains element 573
at toools.set.IntHashSet.remove(IntHashSet.java:66)
at toools.set.IntSet.removeAll(IntSet.java:278)
at grph.Grph.getFringes(Grph.java:3283)
at grph.Grph.getNeighboursAtMostKHops(Grph.java:3252)
at org.purdue.topk.bfs.BFSBuilder.testDiameters(BFSBuilder.java:452)
at org.purdue.topk.bfs.Driver.debugResults(Driver.java:533)
at org.purdue.topk.bfs.Driver.debugACase(Driver.java:548)
at org.purdue.topk.bfs.Driver.main(Driver.java:574)
Here I am trying to find neighbors of node (573) at a distance of '2'. But the
function (getNeighbors()) for the same node works fine.
Is this a bug or is there anything I am doing incorrectly.
In a birds eye view, I am doing the following:
1. Compute the BreadthFirstSearch from a particular node for a number of hops.
2. Hops in the above step is computed dynamically.
Can someone please help.
I am using version 1.5.27 bigjar library. I tried to compile my code with the newer version (1.5.29) but the compilation fails.
Thanks in advance.
Thanks
Sudhir Kylasa
PhD Student @ Purdue University.
--
You received this message because you are subscribed to the Google Groups "Grph: High Performance Graph Library for Java" group.
To unsubscribe from this group and stop receiving emails from it, send an email to grph-high-performance-gr...@googlegroups.com.
To post to this group, send an email to grph-high-performa...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
Luc Hogie
Phone: 06 80 91 40 71
Skype: luchogie
"Je suis heureux parce que c'est bon pour la santé" Voltaire