org.deeplearning4j.models.sequencevectors.graph.walkers.impl

Class NearestVertexWalker<V extends SequenceElement>

java.lang.Object

org.deeplearning4j.models.sequencevectors.graph.walkers.impl.NearestVertexWalker<V>

All Implemented Interfaces:

GraphWalker<V>

public class NearestVertexWalker<V extends SequenceElement>
extends java.lang.Object
implements GraphWalker<V>

This walker represents connections of a given node + their neighborhoods up to certain depth. Basically it's the same idea as context for a given node. So this walker produces Sequences, with label defined. And label - is element itself.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	NearestVertexWalker.Builder<V extends SequenceElement>
protected class	NearestVertexWalker.VertexComparator<V extends SequenceElement,E extends java.lang.Number>

Field Summary

Fields

Modifier and Type	Field and Description
protected int	depth
protected int[]	order
protected java.util.Random	rng
protected SamplingMode	samplingMode
protected long	seed
protected IGraph<V,?>	sourceGraph
protected int	walkLength

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	NearestVertexWalker()

Method Summary

Modifier and Type	Method and Description
boolean	hasNext() This method checks, if walker has any more sequences left in queue
boolean	isLabelEnabled()
Sequence<V>	next() This method returns next walk sequence from this graph
void	reset(boolean shuffle) This method resets walker
protected Sequence<V>	walk(Vertex<V> node, int cDepth)

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.deeplearning4j.models.sequencevectors.graph.walkers.GraphWalker

getSourceGraph

Field Detail

sourceGraph

protected IGraph<V extends SequenceElement,?> sourceGraph

walkLength

protected int walkLength

seed

protected long seed

samplingMode

protected SamplingMode samplingMode

order

protected int[] order

rng

protected java.util.Random rng

depth

protected int depth

Constructor Detail

NearestVertexWalker

protected NearestVertexWalker()

Method Detail

hasNext

public boolean hasNext()

Description copied from interface: GraphWalker

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

Specified by:

hasNext in interface GraphWalker<V extends SequenceElement>

Returns:

next

public Sequence<V> next()

Description copied from interface: GraphWalker

This method returns next walk sequence from this graph

Specified by:

next in interface GraphWalker<V extends SequenceElement>

Returns:

reset

public void reset(boolean shuffle)

Description copied from interface: GraphWalker

This method resets walker

Specified by:

reset in interface GraphWalker<V extends SequenceElement>

Parameters:

shuffle - if TRUE, order of walks will be shuffled

walk

protected Sequence<V> walk(Vertex<V> node,
                           int cDepth)

isLabelEnabled

public boolean isLabelEnabled()

Specified by:

isLabelEnabled in interface GraphWalker<V extends SequenceElement>