org.openscience.cdk.graph

Class MinimalPathIterator

java.lang.Object

org.openscience.cdk.graph.MinimalPathIterator

All Implemented Interfaces:

Iterator

public class MinimalPathIterator
extends Object
implements Iterator

Iterates over all shortest paths between two vertices in an undirected, unweighted graph.

Author:

Ulrich Bauer <ulrich.bauer@alumni.tum.de>

Source code:

master

Belongs to CDK module:

standard

Constructor Summary

Constructors

Constructor and Description
MinimalPathIterator(org._3pq.jgrapht.graph.SimpleGraph g, Object sourceVertex, Object targetVertex) Creates a minimal path iterator for the specified undirected graph.

Method Summary

Methods

Modifier and Type	Method and Description
boolean	hasNext()
Object	next()
void	remove()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MinimalPathIterator

public MinimalPathIterator(org._3pq.jgrapht.graph.SimpleGraph g,
                   Object sourceVertex,
                   Object targetVertex)

Creates a minimal path iterator for the specified undirected graph.

Parameters:

g - the specified graph

sourceVertex - the start vertex for the paths

targetVertex - the target vertex for the paths

Method Detail

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator

next

public Object next()

Specified by:

next in interface Iterator

remove

public void remove()

Specified by:

remove in interface Iterator