Package | Description |
---|---|
lavesdk.math.graph.network | |
lavesdk.utils |
Modifier and Type | Class and Description |
---|---|
class |
Network<V extends Node,E extends Arc>
Represents a network.
|
Modifier and Type | Method and Description |
---|---|
static <V extends Vertex,E extends Edge> |
GraphUtils.breadthFirstSearch(Graph<V,E> graph)
Performs a breadth first search (BFS) in the specified graph starting with the first vertex.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.breadthFirstSearch(Graph<V,E> graph,
V start)
Performs a breadth first search (BFS) in the specified graph starting at a given vertex.
|
static SimpleGraph<Vertex,Edge> |
GraphUtils.createCompleteBipartiteGraph(int n,
int m)
Creates a complete bipartite graph Kn,m of n vertices in the first and m vertices in the second subset.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createCompleteBipartiteGraph(int n,
int m,
GraphFactory<V,E> factory)
Creates a complete bipartite graph Kn,m of n vertices in the first and m vertices in the second subset.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createCompleteBipartiteGraph(int n,
int m,
GraphFactory<V,E> factory,
float maxEdgeWeight)
Creates a complete bipartite graph Kn,m of n vertices in the first and m vertices in the second subset.
|
static SimpleGraph<Vertex,Edge> |
GraphUtils.createCompleteGraph(int n,
boolean directed)
Creates a complete graph Kn of n vertices.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createCompleteGraph(int n,
boolean directed,
GraphFactory<V,E> factory)
Creates a complete graph Kn of n vertices.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createCompleteGraph(int n,
boolean directed,
GraphFactory<V,E> factory,
float maxEdgeWeight)
Creates a complete graph Kn of n vertices.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createGraph(Matrix<? extends java.lang.Number> adjacencyMatrix,
GraphFactory<V,E> factory,
boolean directed)
Creates a graph based on an adjacency matrix where a zero-weight edge indicates that there is no edge between two vertices.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createGraph(Matrix<? extends java.lang.Number> adjacencyMatrix,
GraphFactory<V,E> factory,
boolean directed,
boolean zeroWeightsAllowed)
Creates a graph based on an adjacency matrix.
|
static SimpleGraph<Vertex,Edge> |
GraphUtils.createRandomGraph(int n,
boolean directed)
Creates a random graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createRandomGraph(int n,
boolean directed,
GraphFactory<V,E> factory)
Creates a random graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createRandomGraph(int n,
boolean directed,
GraphFactory<V,E> factory,
float minEdgeWeight,
float maxEdgeWeight)
Creates a random graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.depthFirstSearch(Graph<V,E> graph)
Performs a depth first search (DFS) in the specified graph starting with the first vertex.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.depthFirstSearch(Graph<V,E> graph,
V start)
Performs a depth first search (DFS) in the specified graph starting at a given vertex.
|