org.deeplearning4j.models.sequencevectors.graph.walkers

Interface GraphWalker<T extends SequenceElement>

All Known Implementing Classes:

NearestVertexWalker, PopularityWalker, RandomWalker, WeightedWalker

public interface GraphWalker<T extends SequenceElement>

This interface describes methods needed for various DeepWalk-related implementations

Method Summary

Modifier and Type	Method and Description
IGraph<T,?>	getSourceGraph()
boolean	hasNext() This method checks, if walker has any more sequences left in queue
boolean	isLabelEnabled()
Sequence<T>	next() This method returns next walk sequence from this graph
void	reset(boolean shuffle) This method resets walker

Method Detail

getSourceGraph

IGraph<T,?> getSourceGraph()

hasNext

boolean hasNext()

This method checks, if walker has any more sequences left in queue

Returns:

next

Sequence<T> next()

This method returns next walk sequence from this graph

Returns:

reset

void reset(boolean shuffle)

This method resets walker

Parameters:

shuffle - if TRUE, order of walks will be shuffled

isLabelEnabled

boolean isLabelEnabled()