Package | Description |
---|---|
lavesdk.algorithm.plugin.views | |
lavesdk.math.graph | |
lavesdk.math.graph.network | |
lavesdk.utils |
Modifier and Type | Method and Description |
---|---|
GraphFactory<V,E> |
GraphView.getGraphFactory()
Gets the graph factory which creates the vertices and edges in the graph view.
|
Constructor and Description |
---|
GraphView(java.lang.String title,
Graph<V,E> graph,
GraphFactory<V,E> graphFactory)
Creates a new view of a graph.
|
GraphView(java.lang.String title,
Graph<V,E> graph,
GraphFactory<V,E> graphFactory,
boolean closable)
Creates a new view of a graph.
|
GraphView(java.lang.String title,
Graph<V,E> graph,
GraphFactory<V,E> graphFactory,
boolean closable,
LanguageFile langFile,
java.lang.String langID)
Creates a new view of a graph.
|
GraphView(java.lang.String title,
Graph<V,E> graph,
GraphFactory<V,E> graphFactory,
GraphLayout graphLayout)
Creates a new view of a graph.
|
GraphView(java.lang.String title,
Graph<V,E> graph,
GraphFactory<V,E> graphFactory,
GraphLayout graphLayout,
boolean closable)
Creates a new view of a graph.
|
GraphView(java.lang.String title,
Graph<V,E> graph,
GraphFactory<V,E> graphFactory,
GraphLayout graphLayout,
boolean closable,
LanguageFile langFile,
java.lang.String langID)
Creates a new view of a graph.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultGraphFactory
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultNetworkFactory
|
class |
DefaultRNFactory
|
Modifier and Type | Method and Description |
---|---|
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 <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 <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.invertGraph(Graph<V,E> graph,
GraphFactory<V,E> factory)
Inverts the specified graph meaning a directed graph is transferred in an undirected one and an undirected
graph is transferred in a directed one.
|