Package org.openscience.cdk.graph
Class MinimalPathIterator
- java.lang.Object
-
- org.openscience.cdk.graph.MinimalPathIterator
-
- All Implemented Interfaces:
Iterator
@Deprecated public class MinimalPathIterator extends Object implements Iterator
Deprecated.useShortestPaths
Iterates over all shortest paths between two vertices in an undirected, unweighted graph.- Author:
- Ulrich Bauer <ulrich.bauer@alumni.tum.de>
- Source code:
- main
- Belongs to CDK module:
- standard
-
-
Constructor Summary
Constructors Constructor Description MinimalPathIterator(org._3pq.jgrapht.graph.SimpleGraph g, Object sourceVertex, Object targetVertex)
Deprecated.Creates a minimal path iterator for the specified undirected graph.
-
Method Summary
All Methods Instance Methods Concrete Methods Deprecated Methods Modifier and Type Method Description boolean
hasNext()
Deprecated.Object
next()
Deprecated.void
remove()
Deprecated.-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Methods inherited from interface java.util.Iterator
forEachRemaining
-
-
-
-
Constructor Detail
-
MinimalPathIterator
public MinimalPathIterator(org._3pq.jgrapht.graph.SimpleGraph g, Object sourceVertex, Object targetVertex)
Deprecated.Creates a minimal path iterator for the specified undirected graph.- Parameters:
g
- the specified graphsourceVertex
- the start vertex for the pathstargetVertex
- the target vertex for the paths
-
-