org.deeplearning4j.graph.iterator

Interface GraphWalkIterator<T>

All Known Implementing Classes:

RandomWalkIterator, WeightedRandomWalkIterator

public interface GraphWalkIterator<T>

Interface/iterator representing a sequence of walks on a graph For example, a GraphWalkIterator<T> can represesnt a set of independent random walks on a graph

Method Summary

Modifier and Type	Method and Description
boolean	hasNext() Whether the iterator has any more vertex sequences.
IVertexSequence<T>	next() Get the next vertex sequence.
void	reset() Reset the graph walk iterator.
int	walkLength() Length of the walks returned by next() Note that a walk of length i contains i+1 vertices

Method Detail

walkLength

int walkLength()

Length of the walks returned by next() Note that a walk of length i contains i+1 vertices

next

IVertexSequence<T> next()

Get the next vertex sequence.

hasNext

boolean hasNext()

Whether the iterator has any more vertex sequences.

reset

void reset()

Reset the graph walk iterator.