Package | Description |
---|---|
lavesdk.algorithm | |
lavesdk.algorithm.plugin.views | |
lavesdk.math.graph | |
lavesdk.math.graph.matching | |
lavesdk.math.graph.network | |
lavesdk.utils |
Modifier and Type | Method and Description |
---|---|
<V extends Vertex,E extends Edge> |
AlgorithmState.getMatching(java.lang.String key,
Graph<V,E> graph)
Gets a matching for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getMatching(java.lang.String key,
Graph<V,E> graph,
MatchingByID<E> defValue)
Gets a matching for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getPath(java.lang.String key,
Graph<V,E> graph)
Gets a path for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getPath(java.lang.String key,
Graph<V,E> graph,
PathByID<V> defValue)
Gets a path for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getTrail(java.lang.String key,
Graph<V,E> graph)
Gets a trail for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getTrail(java.lang.String key,
Graph<V,E> graph,
TrailByID<V> defValue)
Gets a trail for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getWalk(java.lang.String key,
Graph<V,E> graph)
Gets a walk for a given data key.
|
<V extends Vertex,E extends Edge> |
AlgorithmState.getWalk(java.lang.String key,
Graph<V,E> graph,
WalkByID<V> defValue)
Gets a walk for a given data key.
|
Modifier and Type | Field and Description |
---|---|
protected Graph<V,E> |
GraphTransferProtocol.graph
the related graph
|
Modifier and Type | Method and Description |
---|---|
Graph<V,E> |
GraphView.getGraph()
Gets the graph of the graph view.
|
Graph<V,E> |
GraphTransferProtocol.getGraph()
Gets the graph that should be transferred.
|
Modifier and Type | Method and Description |
---|---|
<N extends Vertex,L extends Edge> |
GraphView.CircleGraphLayout.layout(Graph<N,L> graph,
GraphView<N,L> graphView) |
abstract <V extends Vertex,E extends Edge> |
GraphLayout.layout(Graph<V,E> graph,
GraphView<V,E> graphView)
Executes the layout algorithm to position the vertices of the given graph.
|
<V extends Vertex,E extends Edge> |
BipartiteGraphLayout.layout(Graph<V,E> graph,
GraphView<V,E> graphView) |
void |
DefaultNetworkView.setGraph(Graph<Node,Arc> network)
Sets the network of the network view.
|
void |
GraphView.setGraph(Graph<V,E> graph)
Sets the graph of the graph view.
|
void |
DefaultRNView.setGraph(Graph<Vertex,RNEdge> rn)
Sets the residual network of the residual network view.
|
Constructor and Description |
---|
DefaultGraphView(java.lang.String title,
Graph<Vertex,Edge> graph)
Creates a new default graph view.
|
DefaultGraphView(java.lang.String title,
Graph<Vertex,Edge> graph,
GraphLayout graphLayout)
Creates a new default graph view.
|
DefaultGraphView(java.lang.String title,
Graph<Vertex,Edge> graph,
GraphLayout graphLayout,
boolean closable,
LanguageFile langFile,
java.lang.String langID)
Creates a new default graph view.
|
DefaultGraphView(java.lang.String title,
Graph<Vertex,Edge> graph,
GraphLayout graphLayout,
boolean closable,
java.lang.String langID)
Creates a new default graph view.
|
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 |
MultiGraph<V extends Vertex,E extends Edge>
Represents a multi graph as a set of vertices and edges.
|
class |
SimpleGraph<V extends Vertex,E extends Edge>
Represents a simple graph as a set of vertices and edges.
|
Modifier and Type | Field and Description |
---|---|
protected Graph<V,? extends Edge> |
WalkByID.graph
the associated graph
|
protected Graph<V,? extends Edge> |
Walk.graph
the associated graph
|
Modifier and Type | Method and Description |
---|---|
protected Graph<? extends Vertex,? extends Edge> |
Vertex.getGraph()
Gets the associated graph of the vertex.
|
protected Graph<? extends Vertex,? extends Edge> |
Edge.getGraph()
Gets the corresponding graph of the edge.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Graph.equals(Graph<V,E> graph)
Indicates whether the specified graph equals this graph.
|
void |
WalkByID.setGraph(Graph<V,? extends Edge> graph)
Sets the associated graph of the walk.
|
Constructor and Description |
---|
AccessibleIDObserver(Graph<?,?> graph)
Creates a new identifier observer.
|
Path(Graph<V,? extends Edge> graph)
Creates an empty path.
|
Path(Graph<V,? extends Edge> graph,
java.util.List<V> path)
Creates a path based on a predefined path.
|
Path(Graph<V,? extends Edge> graph,
V[] path)
Creates a path based on a predefined path.
|
PathByID(Graph<V,? extends Edge> graph)
Creates an empty path.
|
PathByID(Graph<V,? extends Edge> graph,
java.lang.Integer[] path)
Creates a path based on a predefined path.
|
PathByID(Graph<V,? extends Edge> graph,
java.util.List<java.lang.Integer> path)
Creates a path based on a predefined path.
|
Trail(Graph<V,? extends Edge> graph)
Creates an empty trail.
|
Trail(Graph<V,? extends Edge> graph,
java.util.List<V> trail)
Creates a trail based on a predefined trail.
|
Trail(Graph<V,? extends Edge> graph,
V[] trail)
Creates a trail based on a predefined trail.
|
TrailByID(Graph<V,? extends Edge> graph)
Creates an empty trail.
|
TrailByID(Graph<V,? extends Edge> graph,
java.lang.Integer[] trail)
Creates a trail based on a predefined trail.
|
TrailByID(Graph<V,? extends Edge> graph,
java.util.List<java.lang.Integer> trail)
Creates a trail based on a predefined trail.
|
Walk(Graph<V,? extends Edge> graph)
Creates an empty walk.
|
Walk(Graph<V,? extends Edge> graph,
java.util.List<V> walk)
Creates a walk based on a predefined walk.
|
Walk(Graph<V,? extends Edge> graph,
V[] walk)
Creates a walk based on a predefined walk.
|
WalkByID(Graph<V,? extends Edge> graph)
Creates an empty walk.
|
WalkByID(Graph<V,? extends Edge> graph,
java.lang.Integer[] walk)
Creates a walk based on a predefined walk.
|
WalkByID(Graph<V,? extends Edge> graph,
java.util.List<java.lang.Integer> walk)
Creates a walk based on a predefined walk.
|
Modifier and Type | Method and Description |
---|---|
void |
MatchingByID.setGraph(Graph<? extends Vertex,E> graph)
Sets the associated graph of the matching.
|
Constructor and Description |
---|
Matching(Graph<? extends Vertex,E> graph)
Creates an empty matching.
|
MatchingByID(Graph<? extends Vertex,E> graph)
Creates an empty matching.
|
Modifier and Type | Class and Description |
---|---|
class |
Network<V extends Node,E extends Arc>
Represents a network.
|
class |
ResidualNetwork
Represents a residual network of a
Network . |
Modifier and Type | Method and Description |
---|---|
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.
|
static Graph<Vertex,Edge> |
GraphUtils.invertGraph(Graph<Vertex,Edge> graph)
Inverts the specified graph meaning a directed graph is transferred in an undirected one and an undirected
graph is transferred in a directed one.
|
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 <V extends Vertex,E extends Edge> |
GraphUtils.createAdjacencyMatrix(Graph<V,E> graph)
Creates an adjacency matrix of a specified graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.createAdjacencyMatrix(Graph<V,E> graph,
boolean asUpperTriangleMatrix)
Creates an adjacency matrix of a specified 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.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.findAugmentingPath(Graph<V,E> graph,
V start,
Matching<E> m)
Finds an augmenting path beginning with a start vertex in a specified graph based on a given matching.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.findShortestPathFrom(Graph<V,E> graph,
V from,
java.util.Map<V,java.lang.Float> distance,
java.util.Map<V,V> path)
Finds the shortest path from a start vertex to all other vertices of a graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.findShortestPathFromTo(Graph<V,E> graph,
V from,
V to)
Finds the shortest path from a start vertex to all other vertices of a graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.findShortestPaths(Graph<V,E> graph,
Matrix<java.lang.Float> distMatrix,
Matrix<V> predMatrix)
Finds the shortest paths from every vertex to all other vertices of a graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.findShortestPaths(Graph<V,E> graph,
Matrix<java.lang.Float> distMatrix,
Matrix<V> predMatrix,
boolean considerAllVertices)
Finds the shortest paths from every vertex to all other vertices of a graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.getBipartiteVertexSets(Graph<V,E> graph)
Gets the vertex subsets
V1 and V2 so that V1 union V2 = V and V1 intersection V2 = empty set . |
static <V extends Vertex,E extends Edge> |
GraphUtils.getBipartiteVertexSets(Graph<V,E> graph,
boolean nonIncidentVerticesToSubset1)
Gets the vertex subsets
V1 and V2 so that V1 union V2 = V and V1 intersection V2 = empty set . |
static <V extends Vertex,E extends Edge> |
GraphUtils.getConnectedComponents(Graph<V,E> graph)
Gets all connected components from the given 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.
|
static Graph<Vertex,Edge> |
GraphUtils.invertGraph(Graph<Vertex,Edge> graph)
Inverts the specified graph meaning a directed graph is transferred in an undirected one and an undirected
graph is transferred in a directed one.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.is2Colorable(Graph<V,E> graph)
Indicates whether the given graph is 2-colorable.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isBipartite(Graph<V,E> graph)
Indicates whether the given graph is bipartite that means if the graph is simple and the set of vertices can be divided
into two disjoint subsets.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isComplete(Graph<V,E> graph)
Indicates whether the given graph is complete that means if the graph is simple and each vertex of the graph is connected with
each other.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isCompleteBipartite(Graph<V,E> graph)
Indicates whether the given graph is complete bipartite that means the graph is simple and each vertex of subset one
is connected with each vertex of subset two and vice versa.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isConnected(Graph<V,E> graph)
Indicates whether the given graph is (strongly) connected.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isEulerian(Graph<V,E> graph)
Indicates whether the specified graph is an Eulerian graph.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isMultiGraph(Graph<V,E> graph)
Indicates whether the given graph is a multi graph that means the graph has vertices
with more than one edge between them.
|
static <V extends Vertex,E extends Edge> |
GraphUtils.isSimpleGraph(Graph<V,E> graph)
Indicates whether the given graph is a simple graph that means the graph has no loops and two different
vertices are only connected by one edge.
|
static <V extends Vertex> |
GraphUtils.toPath(java.lang.String path,
Graph<V,?> graph)
Converts a specified path as a string in a concrete
Path . |
static <V extends Vertex> |
GraphUtils.toTrail(java.lang.String trail,
Graph<V,? extends Edge> graph,
Trail<Vertex> base)
Converts a specified trail as a string in a concrete
Trail . |
static <V extends Vertex> |
GraphUtils.toWalk(java.lang.String walk,
Graph<V,?> graph)
Converts a specified walk as a string in a concrete
Walk . |