Hi,
[...] Also, I don't know if we have an abstraction for
this, but the order in which you add your connected vertices can be
important, too (might want to do a "greedy" bfs/dfs).
+1.
So far the algorithm has no control over that, as it simply scans an
"Iterator<V>" of adjacent vertices.
--
Claudio Squarcella
PhD student at Roma Tre University
http://www.dia.uniroma3.it/~squarcel
http://squarcella.com/
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org
For additional commands, e-mail: dev-h...@commons.apache.org
