Uses of Interface
org.deeplearning4j.graph.api.IGraph

Packages that use IGraph

Package	Description
org.deeplearning4j.graph
org.deeplearning4j.graph.api
org.deeplearning4j.graph.iterator
org.deeplearning4j.graph.iterator.parallel
org.deeplearning4j.graph.models
org.deeplearning4j.graph.models.deepwalk
org.deeplearning4j.graph.models.embeddings

Uses of IGraph in org.deeplearning4j.graph

Classes in org.deeplearning4j.graph that implement IGraph

Modifier and Type	Class	Description
class	Graph<V,E>

Constructors in org.deeplearning4j.graph with parameters of type IGraph

Constructor	Description
VertexSequence(IGraph<V,?> graph, int[] indices)

Uses of IGraph in org.deeplearning4j.graph.api

Classes in org.deeplearning4j.graph.api that implement IGraph

Modifier and Type	Class	Description
class	BaseGraph<V,E>

Uses of IGraph in org.deeplearning4j.graph.iterator

Constructors in org.deeplearning4j.graph.iterator with parameters of type IGraph

Constructor	Description
RandomWalkIterator(IGraph<V,?> graph, int walkLength)
RandomWalkIterator(IGraph<V,?> graph, int walkLength, long rngSeed)	Construct a RandomWalkIterator for a given graph, with a specified walk length and random number generator seed. Uses NoEdgeHandling.EXCEPTION_ON_DISCONNECTED - hence exception will be thrown when generating random walks on graphs with vertices containing having no edges, or no outgoing edges (for directed graphs)
RandomWalkIterator(IGraph<V,?> graph, int walkLength, long rngSeed, NoEdgeHandling mode)
RandomWalkIterator(IGraph<V,?> graph, int walkLength, long rngSeed, NoEdgeHandling mode, int firstVertex, int lastVertex)	Constructor used to generate random walks starting at a subset of the vertices in the graph.
WeightedRandomWalkIterator(IGraph<V,? extends Number> graph, int walkLength)
WeightedRandomWalkIterator(IGraph<V,? extends Number> graph, int walkLength, long rngSeed)	Construct a RandomWalkIterator for a given graph, with a specified walk length and random number generator seed. Uses NoEdgeHandling.EXCEPTION_ON_DISCONNECTED - hence exception will be thrown when generating random walks on graphs with vertices containing having no edges, or no outgoing edges (for directed graphs)
WeightedRandomWalkIterator(IGraph<V,? extends Number> graph, int walkLength, long rngSeed, NoEdgeHandling mode)
WeightedRandomWalkIterator(IGraph<V,? extends Number> graph, int walkLength, long rngSeed, NoEdgeHandling mode, int firstVertex, int lastVertex)	Constructor used to generate random walks starting at a subset of the vertices in the graph.

Uses of IGraph in org.deeplearning4j.graph.iterator.parallel

Constructors in org.deeplearning4j.graph.iterator.parallel with parameters of type IGraph

Constructor	Description
RandomWalkGraphIteratorProvider(IGraph<V,?> graph, int walkLength)
RandomWalkGraphIteratorProvider(IGraph<V,?> graph, int walkLength, long seed, NoEdgeHandling mode)
WeightedRandomWalkGraphIteratorProvider(IGraph<V,? extends Number> graph, int walkLength)
WeightedRandomWalkGraphIteratorProvider(IGraph<V,? extends Number> graph, int walkLength, long seed, NoEdgeHandling mode)

Uses of IGraph in org.deeplearning4j.graph.models

Methods in org.deeplearning4j.graph.models that return IGraph

Modifier and Type	Method	Description
IGraph<V,E>	GraphVectors.getGraph()

Uses of IGraph in org.deeplearning4j.graph.models.deepwalk

Methods in org.deeplearning4j.graph.models.deepwalk with parameters of type IGraph

Modifier and Type	Method	Description
void	DeepWalk.fit(IGraph<V,E> graph, int walkLength)	Fit the model, in parallel.
void	DeepWalk.initialize(IGraph<V,E> graph)	Initialize the DeepWalk model with a given graph.

Uses of IGraph in org.deeplearning4j.graph.models.embeddings

Fields in org.deeplearning4j.graph.models.embeddings declared as IGraph

Modifier and Type	Field	Description
protected IGraph<V,E>	GraphVectorsImpl.graph

Methods in org.deeplearning4j.graph.models.embeddings that return IGraph

Modifier and Type	Method	Description
IGraph<V,E>	GraphVectorsImpl.getGraph()