Package | Description |
---|---|
lavesdk.algorithm | |
lavesdk.algorithm.plugin.views | |
lavesdk.gui.dialogs | |
lavesdk.gui.widgets | |
lavesdk.math | |
lavesdk.utils |
Modifier and Type | Method and Description |
---|---|
<E extends java.io.Serializable> |
AlgorithmState.addMatrix(java.lang.String key,
Matrix<E> matrix)
Adds a matrix to the state.
|
<E extends java.io.Serializable> |
AlgorithmState.getMatrix(java.lang.String key)
Gets a matrix for a given data key.
|
<E extends java.io.Serializable> |
AlgorithmState.getMatrix(java.lang.String key,
Matrix<E> defValue)
Gets a matrix for a given data key.
|
Modifier and Type | Method and Description |
---|---|
<E extends java.io.Serializable> |
AlgorithmState.addMatrix(java.lang.String key,
Matrix<E> matrix)
Adds a matrix to the state.
|
<E extends java.io.Serializable> |
AlgorithmState.getMatrix(java.lang.String key,
Matrix<E> defValue)
Gets a matrix for a given data key.
|
Modifier and Type | Method and Description |
---|---|
Matrix<T> |
MatrixView.getMatrix()
Gets the matrix that is displayed.
|
Modifier and Type | Method and Description |
---|---|
void |
MatrixView.setMatrix(Matrix<T> matrix)
Sets the matrix that should be displayed.
|
Modifier and Type | Method and Description |
---|---|
Matrix<java.lang.Float> |
AdjacencyMatrixDialog.getAdjacencyMatrix()
Gets the adjacency matrix the user has entered.
|
Modifier and Type | Method and Description |
---|---|
Matrix<T> |
MatrixEditor.getMatrix()
Gets the matrix that is displayed.
|
Modifier and Type | Method and Description |
---|---|
void |
MatrixEditor.setMatrix(Matrix<T> matrix)
Sets the matrix that should be displayed.
|
Constructor and Description |
---|
MatrixEditor(MatrixElementFormat<T> format,
Matrix<T> matrix)
Creates a new matrix editor.
|
Modifier and Type | Class and Description |
---|---|
class |
NumericMatrix<T extends java.lang.Number>
Represents a numeric matrix.
|
class |
ObjectMatrix<T>
Represents an object matrix.
|
Modifier and Type | Method and Description |
---|---|
Matrix<T> |
NumericMatrix.clone() |
abstract Matrix<T> |
Matrix.clone()
Clones the matrix meaning that it is returned a shallow copy of
this Matrix instance
(the elements themselves are not copied/cloned). |
Modifier and Type | Method and Description |
---|---|
static <T> void |
Matrix.copy(Matrix<T> source,
Matrix<T> dest)
Copies the elements of one matrix (source) to another matrix (destination).
|
static <T> void |
Matrix.copy(Matrix<T> source,
Matrix<T> dest)
Copies the elements of one matrix (source) to another matrix (destination).
|
boolean |
Matrix.equals(Matrix<?> matrix)
Indicates whether this matrix equals the specified matrix.
|
Modifier and Type | Method and Description |
---|---|
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.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)
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.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.
|