Detects cycles in a graph. A topological iteration of the nodes of the graph is performed. If the iteration includes all nodes in the graph then the graph is cycle free, otherwise a cycle exists.
@see org.geotools.graph.traverse.standard.BreadthFirstTopologicalIterator
@author Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net
@source $URL$
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.