com.phoenixst.plexus.traversals

Class GraphStructureIterator

public class GraphStructureIterator extends Object implements Iterator

An Iterator over the nodes and edges of a Graph ordered such that the endpoints of a Graph.Edge are always seen before the edge itself. This Iterator may be used to build a Graph with the same structure as some specified Graph, even if it has edges which point to other edges.

Since: 1.0

Version: $Revision: 1.7 $

Author: Ray A. Conner

Constructor Summary
	GraphStructureIterator(Graph graph) Creates a new `GraphStructureIterator`.

Method Summary
boolean	hasNext()
boolean	isEdge() Returns whether or not the last object returned by GraphStructureIterator is a `Graph.Edge` in the `Graph`.
boolean	isNode() Returns whether or not the last object returned by GraphStructureIterator is a node in the `Graph`.
Object	next()
void	remove() Throws an `UnsupportedOperationException`.

Constructor Detail

GraphStructureIterator

public GraphStructureIterator(Graph graph)

Creates a new GraphStructureIterator.

Method Detail

hasNext

public boolean hasNext()

isEdge

public boolean isEdge()

Returns whether or not the last object returned by GraphStructureIterator is a Graph.Edge in the Graph.

isNode

public boolean isNode()

Returns whether or not the last object returned by GraphStructureIterator is a node in the Graph.

public Object next()

remove

public void remove()

Throws an UnsupportedOperationException.