GraphWalker (deeplearning4j-nlp 1.0.0-M2.1 API)

All Known Implementing Classes:

NearestVertexWalker, PopularityWalker, RandomWalker, WeightedWalker
```
public interface GraphWalker<T extends SequenceElement>
```

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	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()
```