edu.ucla.sspace.graph

Class SimpleGraphIterator<T,E extends TypedEdge<T>>

java.lang.Object

edu.ucla.sspace.graph.SimpleGraphIterator<T,E>

All Implemented Interfaces:

Serializable, Iterator<Multigraph<T,E>>

public class SimpleGraphIterator<T,E extends TypedEdge<T>>
extends Object
implements Iterator<Multigraph<T,E>>, Serializable

An iterator over the different permutations of parallel edges within a multigraph that result in connected simple graphs of a specified size. Note that due to the combinatorial nature, this iterator should be used with caution, as the complexity is #P.

Author:

David Jurgens

See Also:

SubgraphIterator, Serialized Form

Constructor Summary

Constructors

Constructor and Description
SimpleGraphIterator(Multigraph<T,E> g, int subgraphSize) Constructs an iterator over all the subgraphs of g with the specified subgraph size.

Method Summary

Methods

Modifier and Type	Method and Description
boolean	hasNext() Returns true if there is at least one more simple graph to return.
Multigraph<T,E>	next() Returns the next simple graph from the multigraph.
void	remove() Throws an UnsupportedOperationException if called.

Methods inherited from class java.lang.Object

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

Constructor Detail

SimpleGraphIterator

public SimpleGraphIterator(Multigraph<T,E> g,
                   int subgraphSize)

Constructs an iterator over all the subgraphs of g with the specified subgraph size.

Parameters:

g - a multigraph

subgraphSize - the size of the subgraphs to return

Throws:

IllegalArgumentException - if subgraphSize is less than 1 or is greater than the number of vertices of g

NullPointerException - if g is null

Method Detail

hasNext

public boolean hasNext()

Returns true if there is at least one more simple graph to return.

Specified by:

hasNext in interface Iterator<Multigraph<T,E extends TypedEdge<T>>>

next

public Multigraph<T,E> next()

Returns the next simple graph from the multigraph.

Specified by:

next in interface Iterator<Multigraph<T,E extends TypedEdge<T>>>

remove

public void remove()

Throws an UnsupportedOperationException if called.

Specified by:

remove in interface Iterator<Multigraph<T,E extends TypedEdge<T>>>