edu.stanford.math.plex4.graph

Class UndirectedListEdgeIterator

java.lang.Object

edu.stanford.math.plex4.graph.UndirectedListEdgeIterator

All Implemented Interfaces:

java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>

public class UndirectedListEdgeIterator
extends java.lang.Object
implements java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>

Author:

Andrew Tausz

Constructor Summary

Constructors

Constructor and Description
UndirectedListEdgeIterator(gnu.trove.TIntObjectHashMap<gnu.trove.TIntHashSet> adjacencySets)

Method Summary

Methods

Modifier and Type	Method and Description
boolean	hasNext()
edu.stanford.math.primitivelib.autogen.pair.IntIntPair	next()
void	remove()

Methods inherited from class java.lang.Object

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

Constructor Detail

UndirectedListEdgeIterator

public UndirectedListEdgeIterator(gnu.trove.TIntObjectHashMap<gnu.trove.TIntHashSet> adjacencySets)

Method Detail

hasNext

public boolean hasNext()

Specified by:

hasNext in interface java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>

next

public edu.stanford.math.primitivelib.autogen.pair.IntIntPair next()

Specified by:

next in interface java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>

remove

public void remove()

Specified by:

remove in interface java.util.Iterator<edu.stanford.math.primitivelib.autogen.pair.IntIntPair>