A B C D E F G H I L M N O P R S T V W

A

addEdge(int, int, E, boolean) - Method in class org.deeplearning4j.graph.api.BaseGraph

addEdge(Edge<E>) - Method in interface org.deeplearning4j.graph.api.IGraph

Add an edge to the graph.

addEdge(int, int, E, boolean) - Method in interface org.deeplearning4j.graph.api.IGraph

Convenience method for adding an edge (directed or undirected) to graph

addEdge(Edge<E>) - Method in class org.deeplearning4j.graph.graph.Graph

B

BaseGraph<V,E> - Class in org.deeplearning4j.graph.api

BaseGraph() - Constructor for class org.deeplearning4j.graph.api.BaseGraph

BinaryTree - Interface in org.deeplearning4j.graph.models

Binary tree interface, used in DeepWalk

build() - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk.Builder

Builder() - Constructor for class org.deeplearning4j.graph.models.deepwalk.DeepWalk.Builder

buildTree(int[]) - Method in class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

Build the Huffman tree given an array of vertex degrees

C

calculateProb(int, int) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

Calculate the probability of the second vertex given the first vertex i.e., P(v_second | v_first)

calculateScore(int, int) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

Calculate score.

create(int) - Method in class org.deeplearning4j.graph.vertexfactory.IntegerVertexFactory

create(int) - Method in class org.deeplearning4j.graph.vertexfactory.StringVertexFactory

create(int) - Method in interface org.deeplearning4j.graph.vertexfactory.VertexFactory

create(int) - Method in class org.deeplearning4j.graph.vertexfactory.VoidVertexFactory

D

DeepWalk<V,E> - Class in org.deeplearning4j.graph.models.deepwalk

Implementation of the DeepWalk graph vectorization model, based on the paper DeepWalk: Online Learning of Social Representations by Perozzi, Al-Rfou & Skiena (2014), http://arxiv.org/abs/1403.6652
Similar to word2vec in nature, DeepWalk is an unsupervised learning algorithm that learns a vector representation of each vertex in a graph.

DeepWalk() - Constructor for class org.deeplearning4j.graph.models.deepwalk.DeepWalk

DeepWalk.Builder<V,E> - Class in org.deeplearning4j.graph.models.deepwalk

DelimitedEdgeLineProcessor - Class in org.deeplearning4j.graph.data.impl

A simple line processor, for data in the format 01\n 30\n etc.

DelimitedEdgeLineProcessor(String, boolean) - Constructor for class org.deeplearning4j.graph.data.impl.DelimitedEdgeLineProcessor

DelimitedEdgeLineProcessor(String, boolean, String...) - Constructor for class org.deeplearning4j.graph.data.impl.DelimitedEdgeLineProcessor

DelimitedVertexLoader - Class in org.deeplearning4j.graph.data.impl

Load vertex information, one per line of form "0Some text attribute/label"

DelimitedVertexLoader(String) - Constructor for class org.deeplearning4j.graph.data.impl.DelimitedVertexLoader

DelimitedVertexLoader(String, String...) - Constructor for class org.deeplearning4j.graph.data.impl.DelimitedVertexLoader

E

Edge<T> - Class in org.deeplearning4j.graph.api

Edge in a graph.

Edge(int, int, T, boolean) - Constructor for class org.deeplearning4j.graph.api.Edge

EdgeLineProcessor<E> - Interface in org.deeplearning4j.graph.data

EdgeLineProcessor is used during data loading from a file, where each edge is on a separate line
Provides flexibility in loading graphs with arbitrary objects/properties that can be represented in a text format Can also be used handle conversion of edges between non-numeric vertices to an appropriate numbered format

equals(Object) - Method in class org.deeplearning4j.graph.api.Edge

equals(Object) - Method in class org.deeplearning4j.graph.api.Vertex

equals(Object) - Method in class org.deeplearning4j.graph.graph.Graph

expTable - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

F

fit(IGraph<V, E>, int) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

Fit the model, in parallel.

fit(GraphWalkIteratorProvider<V>) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

Fit the model, in parallel, using a given GraphWalkIteratorProvider.
This object is used to generate multiple GraphWalkIterators, which can then be distributed to each thread to do in parallel
Note that DeepWalk.fit(IGraph, int) will be more convenient in many cases
Note that DeepWalk.initialize(IGraph) or DeepWalk.initialize(int[]) must be called first.

fit(GraphWalkIterator<V>) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

Fit the DeepWalk model using a single thread using a given GraphWalkIterator.

G

getCode(int) - Method in interface org.deeplearning4j.graph.models.BinaryTree

getCode(int) - Method in class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

getCodeLength(int) - Method in interface org.deeplearning4j.graph.models.BinaryTree

getCodeLength(int) - Method in class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

getCodeString(int) - Method in interface org.deeplearning4j.graph.models.BinaryTree

getCodeString(int) - Method in class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

getConnectedVertexIndices(int) - Method in interface org.deeplearning4j.graph.api.IGraph

Return an array of indexes of vertices that the specified vertex is connected to.
Specifically, for undirected graphs return int[] of all X.vertexID() such that (vertex -- X) exists
For directed graphs, return int[] of all X.vertexID() such that (vertex -> X) exists

getConnectedVertexIndices(int) - Method in class org.deeplearning4j.graph.graph.Graph

getConnectedVertices(int) - Method in interface org.deeplearning4j.graph.api.IGraph

Get a list of all of the vertices that the specified vertex is connected to
Specifically, for undirected graphs return list of all X such that (vertex -- X) exists
For directed graphs, return list of all X such that (vertex -> X) exists

getConnectedVertices(int) - Method in class org.deeplearning4j.graph.graph.Graph

getEdgesOut(int) - Method in interface org.deeplearning4j.graph.api.IGraph

Returns a list of edges for a vertex with a given index For undirected graphs, returns all edges incident on the vertex For directed graphs, only returns outward directed edges

getEdgesOut(int) - Method in class org.deeplearning4j.graph.graph.Graph

getGraph() - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

getGraph() - Method in interface org.deeplearning4j.graph.models.GraphVectors

getGraphWalkIterators(int) - Method in interface org.deeplearning4j.graph.iterator.parallel.GraphWalkIteratorProvider

Get a list of GraphWalkIterators.

getGraphWalkIterators(int) - Method in class org.deeplearning4j.graph.iterator.parallel.RandomWalkGraphIteratorProvider

getGraphWalkIterators(int) - Method in class org.deeplearning4j.graph.iterator.parallel.WeightedRandomWalkGraphIteratorProvider

getInnerNodeVector(int) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

getLearningRate() - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

getNumVertices() - Method in interface org.deeplearning4j.graph.models.embeddings.GraphVectorLookupTable

Returns the number of vertices in the graph

getNumVertices() - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

getOutWeights() - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

getPathInnerNodes(int) - Method in interface org.deeplearning4j.graph.models.BinaryTree

getPathInnerNodes(int) - Method in class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

getRandomConnectedVertex(int, Random) - Method in interface org.deeplearning4j.graph.api.IGraph

Randomly sample a vertex connected to a given vertex.

getRandomConnectedVertex(int, Random) - Method in class org.deeplearning4j.graph.graph.Graph

getTree() - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

getValue() - Method in class org.deeplearning4j.graph.api.Vertex

getVector(int) - Method in interface org.deeplearning4j.graph.models.embeddings.GraphVectorLookupTable

Get the vector for the vertex with index idx

getVector(int) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

getVectorSize() - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

getVectorSize() - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

getVectorSize() - Method in interface org.deeplearning4j.graph.models.GraphVectors

getVertex(int) - Method in interface org.deeplearning4j.graph.api.IGraph

Get a vertex in the graph for a given index

getVertex(int) - Method in class org.deeplearning4j.graph.graph.Graph

getVertexDegree(int) - Method in interface org.deeplearning4j.graph.api.IGraph

Returns the degree of the vertex.
For undirected graphs, this is just the degree.
For directed graphs, this returns the outdegree

getVertexDegree(int) - Method in class org.deeplearning4j.graph.graph.Graph

getVertexVector(Vertex<V>) - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

getVertexVector(int) - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

getVertexVector(Vertex<V>) - Method in interface org.deeplearning4j.graph.models.GraphVectors

getVertexVector(int) - Method in interface org.deeplearning4j.graph.models.GraphVectors

getVertexVectors() - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

getVertices(int[]) - Method in interface org.deeplearning4j.graph.api.IGraph

Get multiple vertices in the graph

getVertices(int, int) - Method in interface org.deeplearning4j.graph.api.IGraph

Get multiple vertices in the graph, with secified indices

getVertices(int[]) - Method in class org.deeplearning4j.graph.graph.Graph

getVertices(int, int) - Method in class org.deeplearning4j.graph.graph.Graph

getWindowSize() - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

Graph<V,E> - Class in org.deeplearning4j.graph.graph

Graph, where all edges and vertices are stored in-memory.
Internally, this is a directed graph with adjacency list representation; however, if undirected edges are added, these edges are duplicated internally to allow for fast lookup.
Depending on the value of allowMultipleEdges, this graph implementation may or may not allow multiple edges between any two adjacent nodes.

Graph(int, VertexFactory<V>) - Constructor for class org.deeplearning4j.graph.graph.Graph

Graph(int, boolean, VertexFactory<V>) - Constructor for class org.deeplearning4j.graph.graph.Graph

Graph(List<Vertex<V>>, boolean) - Constructor for class org.deeplearning4j.graph.graph.Graph

Graph(List<Vertex<V>>) - Constructor for class org.deeplearning4j.graph.graph.Graph

graph - Variable in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

GraphHuffman - Class in org.deeplearning4j.graph.models.deepwalk

An implementation of a Huffman tree specifically for graphs.

GraphHuffman(int) - Constructor for class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

GraphHuffman(int, int) - Constructor for class org.deeplearning4j.graph.models.deepwalk.GraphHuffman

GraphLoader - Class in org.deeplearning4j.graph.data

Utility methods for loading graphs

GraphVectorLookupTable - Interface in org.deeplearning4j.graph.models.embeddings

Lookup table for vector representations of the vertices in a graph

GraphVectors<V,E> - Interface in org.deeplearning4j.graph.models

Vectors for nodes in a graph.

GraphVectorSerializer - Class in org.deeplearning4j.graph.models.loader

GraphVectorSerializer: Provide static methods to save and load DeepWalk/Graph vectors

GraphVectorsImpl<V,E> - Class in org.deeplearning4j.graph.models.embeddings

Base implementation for GraphVectors.

GraphVectorsImpl() - Constructor for class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

GraphWalkIterator<T> - Interface in org.deeplearning4j.graph.iterator

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

GraphWalkIteratorProvider<V> - Interface in org.deeplearning4j.graph.iterator.parallel

GraphWalkIteratorProvider: implementations of this interface provide a set of GraphWalkIterator objects.

H

hashCode() - Method in class org.deeplearning4j.graph.api.Edge

hashCode() - Method in class org.deeplearning4j.graph.api.Vertex

hashCode() - Method in class org.deeplearning4j.graph.graph.Graph

hasNext() - Method in class org.deeplearning4j.graph.graph.VertexSequence

hasNext() - Method in interface org.deeplearning4j.graph.iterator.GraphWalkIterator

Whether the iterator has any more vertex sequences.

hasNext() - Method in class org.deeplearning4j.graph.iterator.RandomWalkIterator

hasNext() - Method in class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

I

IGraph<V,E> - Interface in org.deeplearning4j.graph.api

Interface for a IGraph, with objects for each vertex and edge.

initialize(IGraph<V, E>) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

Initialize the DeepWalk model with a given graph.

initialize(int[]) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

Initialize the DeepWalk model with a list of vertex degrees for a graph.
Specifically, graphVertexDegrees[i] represents the vertex degree of the ith vertex
vertex degrees are used to construct a binary (Huffman) tree, which is in turn used in the hierarchical softmax implementation

InMemoryGraphLookupTable - Class in org.deeplearning4j.graph.models.embeddings

A standard in-memory implementation of a lookup table for vector representations of the vertices in a graph

InMemoryGraphLookupTable(int, int, BinaryTree, double) - Constructor for class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

IntegerVertexFactory - Class in org.deeplearning4j.graph.vertexfactory

IntegerVertexFactory() - Constructor for class org.deeplearning4j.graph.vertexfactory.IntegerVertexFactory

iterate(int, int) - Method in interface org.deeplearning4j.graph.models.embeddings.GraphVectorLookupTable

Conduct learning given a pair of vertices (in and out)

iterate(int, int) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

IVertexSequence<T> - Interface in org.deeplearning4j.graph.api

Represents a sequence of vertices in a graph.
General-purpose, but can be used to represent a walk on a graph, for example.

L

learningRate(double) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk.Builder

Set the learning rate

learningRate - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

loadGraph(String, EdgeLineProcessor<E>, VertexFactory<V>, int, boolean) - Static method in class org.deeplearning4j.graph.data.GraphLoader

Load a graph into memory, using a given EdgeLineProcessor.

loadGraph(String, String, VertexLoader<V>, EdgeLineProcessor<E>, boolean) - Static method in class org.deeplearning4j.graph.data.GraphLoader

Load graph, assuming vertices are in one file and edges are in another file.

loadTxtVectors(File) - Static method in class org.deeplearning4j.graph.models.loader.GraphVectorSerializer

loadUndirectedGraphEdgeListFile(String, int, String) - Static method in class org.deeplearning4j.graph.data.GraphLoader

Simple method for loading an undirected graph, where the graph is represented by a edge list with one edge per line with a delimiter in between
This method assumes that all lines in the file are of the form i<delim>j where i and j are integers in range 0 to numVertices inclusive, and "" is the user-provided delimiter Note: this method calls GraphLoader.loadUndirectedGraphEdgeListFile(String, int, String, boolean) with allowMultipleEdges = true.

loadUndirectedGraphEdgeListFile(String, int, String, boolean) - Static method in class org.deeplearning4j.graph.data.GraphLoader

Simple method for loading an undirected graph, where the graph is represented by a edge list with one edge per line with a delimiter in between
This method assumes that all lines in the file are of the form i<delim>j where i and j are integers in range 0 to numVertices inclusive, and "" is the user-provided delimiter

loadVertices(String) - Method in class org.deeplearning4j.graph.data.impl.DelimitedVertexLoader

loadVertices(String) - Method in interface org.deeplearning4j.graph.data.VertexLoader

loadWeightedEdgeListFile(String, int, String, boolean, String...) - Static method in class org.deeplearning4j.graph.data.GraphLoader

Method for loading a weighted graph from an edge list file, where each edge (inc.

loadWeightedEdgeListFile(String, int, String, boolean, boolean, String...) - Static method in class org.deeplearning4j.graph.data.GraphLoader

Method for loading a weighted graph from an edge list file, where each edge (inc.

lookupTable() - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

lookupTable - Variable in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

M

MAX_EXP - Static variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

N

next() - Method in class org.deeplearning4j.graph.graph.VertexSequence

next() - Method in interface org.deeplearning4j.graph.iterator.GraphWalkIterator

Get the next vertex sequence.

next() - Method in class org.deeplearning4j.graph.iterator.RandomWalkIterator

next() - Method in class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

NoEdgeHandling - Enum in org.deeplearning4j.graph.api

When walking a graph, how should we handle disconnected nodes? i.e., those without any outgoing (directed) or undirected edges

NoEdgesException - Exception in org.deeplearning4j.graph.exception

Unchecked exception, thrown to signify that an operation (usually on a vertex) cannot be completed because there are no edges for that vertex.

NoEdgesException() - Constructor for exception org.deeplearning4j.graph.exception.NoEdgesException

NoEdgesException(String) - Constructor for exception org.deeplearning4j.graph.exception.NoEdgesException

NoEdgesException(String, Exception) - Constructor for exception org.deeplearning4j.graph.exception.NoEdgesException

numVertices() - Method in interface org.deeplearning4j.graph.api.IGraph

Number of vertices in the graph

numVertices() - Method in class org.deeplearning4j.graph.graph.Graph

numVertices() - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

numVertices() - Method in interface org.deeplearning4j.graph.models.GraphVectors

nVertices - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

O

org.deeplearning4j.graph.api - package org.deeplearning4j.graph.api

org.deeplearning4j.graph.data - package org.deeplearning4j.graph.data

org.deeplearning4j.graph.data.impl - package org.deeplearning4j.graph.data.impl

org.deeplearning4j.graph.exception - package org.deeplearning4j.graph.exception

org.deeplearning4j.graph.graph - package org.deeplearning4j.graph.graph

org.deeplearning4j.graph.iterator - package org.deeplearning4j.graph.iterator

org.deeplearning4j.graph.iterator.parallel - package org.deeplearning4j.graph.iterator.parallel

org.deeplearning4j.graph.models - package org.deeplearning4j.graph.models

org.deeplearning4j.graph.models.deepwalk - package org.deeplearning4j.graph.models.deepwalk

org.deeplearning4j.graph.models.embeddings - package org.deeplearning4j.graph.models.embeddings

org.deeplearning4j.graph.models.loader - package org.deeplearning4j.graph.models.loader

org.deeplearning4j.graph.vertexfactory - package org.deeplearning4j.graph.vertexfactory

outWeights - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

P

ParseException - Exception in org.deeplearning4j.graph.exception

Unchecked exception signifying that an error occurred during parsing of text

ParseException() - Constructor for exception org.deeplearning4j.graph.exception.ParseException

ParseException(String) - Constructor for exception org.deeplearning4j.graph.exception.ParseException

ParseException(String, Exception) - Constructor for exception org.deeplearning4j.graph.exception.ParseException

processLine(String) - Method in interface org.deeplearning4j.graph.data.EdgeLineProcessor

Process a line of text into an edge.

processLine(String) - Method in class org.deeplearning4j.graph.data.impl.DelimitedEdgeLineProcessor

processLine(String) - Method in class org.deeplearning4j.graph.data.impl.WeightedEdgeLineProcessor

R

RandomWalkGraphIteratorProvider<V> - Class in org.deeplearning4j.graph.iterator.parallel

Random walk graph iterator provider: given a graph, split up the generation of random walks for parallel learning.

RandomWalkGraphIteratorProvider(IGraph<V, ?>, int) - Constructor for class org.deeplearning4j.graph.iterator.parallel.RandomWalkGraphIteratorProvider

RandomWalkGraphIteratorProvider(IGraph<V, ?>, int, long, NoEdgeHandling) - Constructor for class org.deeplearning4j.graph.iterator.parallel.RandomWalkGraphIteratorProvider

RandomWalkIterator<V> - Class in org.deeplearning4j.graph.iterator

Given a graph, iterate through random walks on that graph of a specified length.

RandomWalkIterator(IGraph<V, ?>, int) - Constructor for class org.deeplearning4j.graph.iterator.RandomWalkIterator

RandomWalkIterator(IGraph<V, ?>, int, long) - Constructor for class org.deeplearning4j.graph.iterator.RandomWalkIterator

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, ?>, int, long, NoEdgeHandling) - Constructor for class org.deeplearning4j.graph.iterator.RandomWalkIterator

RandomWalkIterator(IGraph<V, ?>, int, long, NoEdgeHandling, int, int) - Constructor for class org.deeplearning4j.graph.iterator.RandomWalkIterator

Constructor used to generate random walks starting at a subset of the vertices in the graph.

remove() - Method in class org.deeplearning4j.graph.graph.VertexSequence

reset() - Method in interface org.deeplearning4j.graph.iterator.GraphWalkIterator

Reset the graph walk iterator.

reset() - Method in class org.deeplearning4j.graph.iterator.RandomWalkIterator

reset() - Method in class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

resetWeights() - Method in interface org.deeplearning4j.graph.models.embeddings.GraphVectorLookupTable

Reset (randomize) the weights.

resetWeights() - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

S

seed(long) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk.Builder

Seed for random number generation (used for repeatability).

sequenceLength() - Method in interface org.deeplearning4j.graph.api.IVertexSequence

Length of the vertex sequence

sequenceLength() - Method in class org.deeplearning4j.graph.graph.VertexSequence

setLearningRate(double) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

setLearningRate(double) - Method in interface org.deeplearning4j.graph.models.embeddings.GraphVectorLookupTable

Set the learning rate

setLearningRate(double) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

setVertexVectors(INDArray) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

similarity(Vertex<V>, Vertex<V>) - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

Returns the cosine similarity of the vector representations of two vertices in the graph

similarity(int, int) - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

Returns the cosine similarity of the vector representations of two vertices in the graph, given the indices of these verticies

similarity(Vertex<V>, Vertex<V>) - Method in interface org.deeplearning4j.graph.models.GraphVectors

similarity(int, int) - Method in interface org.deeplearning4j.graph.models.GraphVectors

STATUS_UPDATE_FREQUENCY - Static variable in class org.deeplearning4j.graph.models.deepwalk.DeepWalk

StringVertexFactory - Class in org.deeplearning4j.graph.vertexfactory

StringVertexFactory() - Constructor for class org.deeplearning4j.graph.vertexfactory.StringVertexFactory

StringVertexFactory(String) - Constructor for class org.deeplearning4j.graph.vertexfactory.StringVertexFactory

T

toString() - Method in class org.deeplearning4j.graph.api.Edge

toString() - Method in class org.deeplearning4j.graph.api.Vertex

toString() - Method in class org.deeplearning4j.graph.graph.Graph

tree - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

V

valueOf(String) - Static method in enum org.deeplearning4j.graph.api.NoEdgeHandling

Returns the enum constant of this type with the specified name.

values() - Static method in enum org.deeplearning4j.graph.api.NoEdgeHandling

Returns an array containing the constants of this enum type, in the order they are declared.

vectorsAndGradients(int, int) - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

Returns vertex vector and vector gradients, plus inner node vectors and inner node gradients
Specifically, out[0] are vectors, out[1] are gradients for the corresponding vectors
out[0][0] is vector for first vertex; out[0][1] is gradient for this vertex vector
out[0][i] (i>0) is the inner node vector along path to second vertex; out[1][i] is gradient for inner node vertex
This design is used primarily to aid in testing (numerical gradient checks)

vectorSize(int) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk.Builder

Sets the size of the vectors to be learned for each vertex in the graph

vectorSize() - Method in interface org.deeplearning4j.graph.models.embeddings.GraphVectorLookupTable

The size of the vector representations

vectorSize - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

vectorSize() - Method in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

Vertex<T> - Class in org.deeplearning4j.graph.api

Vertex in a graph

Vertex() - Constructor for class org.deeplearning4j.graph.api.Vertex

VertexFactory<T> - Interface in org.deeplearning4j.graph.vertexfactory

Vertex factory, used to create nodes from an integer index (0 to nVertices-1 inclusive)

vertexID() - Method in class org.deeplearning4j.graph.api.Vertex

VertexLoader<V> - Interface in org.deeplearning4j.graph.data

Interface defines a method of leading vertices from a file.

VertexSequence<V> - Class in org.deeplearning4j.graph.graph

A vertex sequence represents a sequences of vertices in a graph

VertexSequence(IGraph<V, ?>, int[]) - Constructor for class org.deeplearning4j.graph.graph.VertexSequence

vertexVectors - Variable in class org.deeplearning4j.graph.models.embeddings.InMemoryGraphLookupTable

verticesNearest(int, int) - Method in class org.deeplearning4j.graph.models.embeddings.GraphVectorsImpl

verticesNearest(int, int) - Method in interface org.deeplearning4j.graph.models.GraphVectors

VoidVertexFactory - Class in org.deeplearning4j.graph.vertexfactory

VoidVertexFactory() - Constructor for class org.deeplearning4j.graph.vertexfactory.VoidVertexFactory

W

walkLength() - Method in interface org.deeplearning4j.graph.iterator.GraphWalkIterator

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

walkLength() - Method in class org.deeplearning4j.graph.iterator.RandomWalkIterator

walkLength() - Method in class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

WeightedEdgeLineProcessor - Class in org.deeplearning4j.graph.data.impl

A simple line processor, for data in the format 0<delim>1<delim>weight.

WeightedEdgeLineProcessor(String, boolean) - Constructor for class org.deeplearning4j.graph.data.impl.WeightedEdgeLineProcessor

WeightedEdgeLineProcessor(String, boolean, String...) - Constructor for class org.deeplearning4j.graph.data.impl.WeightedEdgeLineProcessor

WeightedRandomWalkGraphIteratorProvider<V> - Class in org.deeplearning4j.graph.iterator.parallel

Weighted random walk graph iterator provider: given a weighted graph (of type IGraph<?,? extends Number>), split up the generation of weighted random walks for parallel learning.

WeightedRandomWalkGraphIteratorProvider(IGraph<V, ? extends Number>, int) - Constructor for class org.deeplearning4j.graph.iterator.parallel.WeightedRandomWalkGraphIteratorProvider

WeightedRandomWalkGraphIteratorProvider(IGraph<V, ? extends Number>, int, long, NoEdgeHandling) - Constructor for class org.deeplearning4j.graph.iterator.parallel.WeightedRandomWalkGraphIteratorProvider

WeightedRandomWalkIterator<V> - Class in org.deeplearning4j.graph.iterator

Given a graph, iterate through random walks on that graph of a specified length.

WeightedRandomWalkIterator(IGraph<V, ? extends Number>, int) - Constructor for class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

WeightedRandomWalkIterator(IGraph<V, ? extends Number>, int, long) - Constructor for class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

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>, int, long, NoEdgeHandling) - Constructor for class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

WeightedRandomWalkIterator(IGraph<V, ? extends Number>, int, long, NoEdgeHandling, int, int) - Constructor for class org.deeplearning4j.graph.iterator.WeightedRandomWalkIterator

Constructor used to generate random walks starting at a subset of the vertices in the graph.

windowSize(int) - Method in class org.deeplearning4j.graph.models.deepwalk.DeepWalk.Builder

Sets the window size used in skipgram model

writeGraphVectors(DeepWalk, String) - Static method in class org.deeplearning4j.graph.models.loader.GraphVectorSerializer

A B C D E F G H I L M N O P R S T V W