-
perfecthash changed the public information on the JGraphT project.
2010-01-04 00:36:13 UTC by perfecthash
-
perfecthash changed the public information on the JGraphT project.
2010-01-04 00:36:13 UTC by perfecthash
-
perfecthash changed the public information on the JGraphT project.
2010-01-03 23:15:42 UTC by perfecthash
-
The attached "iteration_adviser.patch" is really just a prototype for experimentation purposes. It has no tests, JavaDoc, or anything like that and is not intended to be considered as a contribution. I just wanted to get my initial attempt out there for the sake of early feedback.
I've gotten DepthLimitedDepthFirstIterator to work over a tree so long as setCrossComponentTraversal(false) is...
2009-12-17 19:29:33 UTC by ibrandt
-
It would be nice if you could conditionally skip a vertex, or all descendants of a vertex, during iteration over a graph. One use case might be to limit the depth of a search over a directed graph by skipping descendants of any vertex at a given depth.
Original forum thread here: https://sourceforge.net/projects/jgrapht/forums/forum/296039/topic/3485506.
2009-12-17 18:56:35 UTC by ibrandt
-
perfecthash committed revision 697 to the JGraphT SVN repository, changing 4 files.
2009-09-08 22:21:13 UTC by perfecthash
-
What version of JGraphT are you referring to? I'm looking at the latest code, and I don't see any explicit call to the hashCode method. Closing this; please reopen if there's a specific line of code you're referring to. Or submit a unit test which demonstrates behavior you believe to be incorrect.
2009-07-20 16:19:50 UTC by perfecthash
-
Hi,
at least the
public E addEdge(V sourceVertex,V targetVertex)
method in the AbstractBaseGraph class uses the hashCode() method to check wether a given vertex already exists or not in the graph. This should be replaced by a call to the equals() method, because, as stated in the Sun JavaDoc for the hashCode() method in the Object class
"""
It is not required that if two objects are...
2009-07-20 16:11:36 UTC by alfredio
