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 Thu, 01 Mar 2012 22:06:31 GMT
Hi,

> Added an extra check to prevent
> discovering multiple edges that lead to the same (already visited) vertex.

cool stuff, thanks for turning human words into computer words :)
I spent a couple minutes running the tests on max-flow algos with 
breakpoints and stuff, and apparently they keep avoiding zero-capacity 
links during graph visit. Excellent!

Claudio

-- 
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