| Modifier and Type | Method and Description |
|---|---|
Vertex<V> |
Graph.getRandomConnectedVertex(int vertex,
Random rng) |
Vertex<V> |
IGraph.getRandomConnectedVertex(int vertex,
Random rng)
Randomly sample a vertex connected to a given vertex.
|
Vertex<V> |
Graph.getVertex(int idx) |
Vertex<V> |
IGraph.getVertex(int idx)
Get a vertex in the graph for a given index
|
| Modifier and Type | Method and Description |
|---|---|
List<Vertex<V>> |
Graph.getConnectedVertices(int vertex) |
List<Vertex<V>> |
IGraph.getConnectedVertices(int vertex)
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 |
List<Vertex<V>> |
Graph.getVertices(int[] indexes) |
List<Vertex<V>> |
IGraph.getVertices(int[] indexes)
Get multiple vertices in the graph
|
List<Vertex<V>> |
Graph.getVertices(int from,
int to) |
List<Vertex<V>> |
IGraph.getVertices(int from,
int to)
Get multiple vertices in the graph, with secified indices
|
| Modifier and Type | Method and Description |
|---|---|
void |
Graph.addVertex(Vertex<V> vertex,
Collection<Edge<E>> edges) |
void |
Graph.addVertex(Vertex<V> vertex,
Edge<E> edge) |
| Constructor and Description |
|---|
Graph(List<Vertex<V>> vertices) |
Graph(List<Vertex<V>> vertices,
boolean allowMultipleEdges) |
| Modifier and Type | Method and Description |
|---|---|
Vertex<T> |
AbstractVertexFactory.create(int vertexIdx) |
Vertex<T> |
VertexFactory.create(int vertexIdx) |
Vertex<T> |
AbstractVertexFactory.create(int vertexIdx,
T element) |
Vertex<T> |
VertexFactory.create(int vertexIdx,
T element) |
| Modifier and Type | Method and Description |
|---|---|
int |
NearestVertexWalker.VertexComparator.compare(Vertex<V> o1,
Vertex<V> o2) |
int |
NearestVertexWalker.VertexComparator.compare(Vertex<V> o1,
Vertex<V> o2) |
protected Sequence<V> |
NearestVertexWalker.walk(Vertex<V> node,
int cDepth) |
Copyright © 2020. All rights reserved.