| Modifier and Type | Class and Description |
|---|---|
class |
BaseGraph<V,E> |
| Modifier and Type | Class and Description |
|---|---|
class |
Graph<V,E>
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. |
| Constructor and Description |
|---|
VertexSequence(IGraph<V,?> graph,
int[] indices) |
| Constructor and 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.
|
| Constructor and 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) |
| Modifier and Type | Method and Description |
|---|---|
IGraph<V,E> |
GraphVectors.getGraph() |
| Modifier and Type | Method and 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.
|
| Modifier and Type | Field and Description |
|---|---|
protected IGraph<V,E> |
GraphVectorsImpl.graph |
| Modifier and Type | Method and Description |
|---|---|
IGraph<V,E> |
GraphVectorsImpl.getGraph() |
Copyright © 2016. All Rights Reserved.