commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Claudio Squarcella <squar...@dia.uniroma3.it>
Subject Re: [graph] Doubts on DFS algorithm implementation
Date Mon, 27 Feb 2012 18:17:24 GMT
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-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message