broadwick.graph

Class DepthFirstIterator<V extends Vertex,E extends Edge<V>>

java.lang.Object

broadwick.graph.DepthFirstIterator<V,E>

Type Parameters:

V - the class type of the vertex.

E - the class type of the edges.

All Implemented Interfaces:

Iterator<V>

public class DepthFirstIterator<V extends Vertex,E extends Edge<V>>
extends Object
implements Iterator<V>

Iterator over all the vertices in a graph using a depth first traversal algorithm.

Field Summary

Fields

Modifier and Type	Field and Description
private List<V>	vertexList

Constructor Summary

Constructors

Constructor and Description
DepthFirstIterator(Tree<V,E> tree) Create the iterator over a tree.

Method Summary

Modifier and Type	Method and Description
boolean	hasNext()
V	next()
void	remove()
private void	traverseTree(Tree<V,E> tree) Perform a depth first traversal through the tree recording, in a linked list, the vertices visited in order.

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

Field Detail

vertexList

private List<V extends Vertex> vertexList

Constructor Detail

DepthFirstIterator

public DepthFirstIterator(Tree<V,E> tree)

Create the iterator over a tree. The tree is read and the vertices arranged (internally) so that they can be read back one at a time in a depth-first order.

Parameters:

tree - the tree to which to attach the iterator.

Method Detail

hasNext

public final boolean hasNext()

Specified by:

hasNext in interface Iterator<V extends Vertex>

next

public final V next()

Specified by:

next in interface Iterator<V extends Vertex>

remove

public final void remove()

Specified by:

remove in interface Iterator<V extends Vertex>

traverseTree

private void traverseTree(Tree<V,E> tree)

Perform a depth first traversal through the tree recording, in a linked list, the vertices visited in order.

Parameters:

tree - the tree to be traversed.