Modifier and Type | Method and Description |
---|---|
<E extends Edge> |
AlgorithmState.addMatching(java.lang.String key,
MatchingByID<E> m)
Adds a matching to the state.
|
<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.getScene(java.lang.String key,
GraphScene<V,E> defValue)
Gets a scene 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 | Class and Description |
---|---|
class |
BipartiteGraphToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by graph functionality to check whether a graph is bipartite.
|
class |
BipartiteLayoutToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by graph functionality to layout the vertices of a graph bipartite.
|
class |
CircleLayoutToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by graph functionality to layout the vertices of a graph in a circle.
|
class |
CompleteBipartiteGraphToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by graph functionality to check whether a graph is complete bipartite and to create complete bipartite graphs.
|
class |
CompleteGraphToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by graph functionality to check whether a graph is complete and to create complete graphs.
|
class |
MatrixToGraphToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by functionality to create graphs by use of an adjacency matrix.
|
class |
RandomGraphToolBarExtension<V extends Vertex,E extends Edge>
Extends the toolbar of a host application by functionality to create randomly generated graphs.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultTransferProtocol<V extends Vertex,E extends Edge>
A default implementation of a
GraphTransferProtocol that makes it possible to transfer a graph of one graph view to another
or to the same. |
class |
GraphScene<V extends Vertex,E extends Edge>
Represents a scene in a
GraphView . |
class |
GraphTransferProtocol<V extends Vertex,E extends Edge>
The graph transfer protocol specifies how a graph is transfered from one graph view to another.
|
class |
GraphView<V extends Vertex,E extends Edge>
Represents the view of a graph.
|
interface |
GraphViewListener<V extends Vertex,E extends Edge>
Listener to listen to events of a
GraphView . |
class |
VertexOnlyTransferProtocol<V extends Vertex,E extends Edge>
A
GraphTransferProtocol that only transfers the vertices of a GraphView to another graph view or the same. |
Modifier and Type | Field and Description |
---|---|
E |
GraphView.EdgeOffset.edge
the edge
|
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) |
<N extends Vertex,L extends Edge> |
GraphView.transferGraph(GraphTransferProtocol<N,L> gtp)
Transfers a graph of another graph view into this one.
|
Modifier and Type | Method and Description |
---|---|
GraphView.VisualEdge |
GraphView.getVisualEdge(Edge e)
Gets the visual edge of a given edge.
|
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.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultEdgeRenderer<T extends Edge>
The default renderer of edges.
|
interface |
EdgeRenderer<T extends Edge>
Interface to render edges in a
GraphView . |
Modifier and Type | Class and Description |
---|---|
class |
AdjacencyMatrix<V extends Vertex,E extends Edge>
Represents an adjacency matrix of a graph.
|
class |
Graph<V extends Vertex,E extends Edge>
Represents a graph as a set of vertices and edges.
|
class |
GraphFactory<V extends Vertex,E extends Edge>
Factory class to create specific vertices and edges for a graph.
|
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 |
---|---|
Edge |
DefaultGraphFactory.createEdge(Vertex predecessor,
Vertex successor) |
Edge |
DefaultGraphFactory.createEdge(Vertex predecessor,
Vertex successor,
boolean directed) |
Edge |
DefaultGraphFactory.createEdge(Vertex predecessor,
Vertex successor,
boolean directed,
float weight) |
Edge |
DefaultGraphFactory.createEdge(Vertex predecessor,
Vertex successor,
float weight) |
Edge |
Trail.getEdge(int index)
Gets the edge of the trail at the specified index.
|
Edge |
Vertex.getIncidentEdge(int index)
Gets an incident edge at the given index.
|
Edge |
Vertex.getIncomingEdge(int index)
Gets an incoming edge at the given index.
|
Edge |
Vertex.getOutgoingEdge(int index)
Gets an outgoing edge at the given index.
|
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 |
---|---|
void |
Trail.add(V vertex,
Edge edge)
Adds a new vertex to the trail using the specified edge.
|
boolean |
WalkByID.contains(Edge edge)
Indicates whether the walk contains the specified edge or more precisely whether the walk contains
the predecessor and the successor of the edge regarding the direction of the edge.
|
boolean |
Walk.contains(Edge edge)
Indicates whether the walk contains the specified edge or more precisely whether the walk contains
the predecessor and the successor of the edge regarding the direction of the edge.
|
boolean |
TrailByID.contains(Edge e)
Indicates whether the trail contains the specified edge.
|
boolean |
Trail.contains(Edge e)
Indicates whether the trail contains the specified edge.
|
boolean |
Edge.equals(Edge e)
Indicates whether the given edge equals this edge.
|
boolean |
Edge.equalsIgnoreWeight(Edge e)
Indicates whether the given edge equals this edge.
|
Modifier and Type | Method and Description |
---|---|
void |
WalkByID.setGraph(Graph<V,? extends Edge> graph)
Sets the associated graph of the walk.
|
Constructor and Description |
---|
AccessibleID(Edge edge)
Creates a new accessible identifier based on an
Edge . |
Constructor and Description |
---|
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 | Class and Description |
---|---|
class |
Matching<E extends Edge>
Represents a matching.
|
class |
MatchingByID<E extends Edge>
Represents a matching using the identifiers of
Edge s. |
Modifier and Type | Class and Description |
---|---|
class |
Arc
Represents an edge in a
Network . |
class |
RNEdge
Represents an edge in a residual network of a
Network . |
Modifier and Type | Method and Description |
---|---|
boolean |
RNEdge.equals(Edge e) |
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.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.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 <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.isAugmentingPath(Path<V> path,
Matching<E> matching)
Indicates whether the specified path is an augmenting path on the given matching.
|
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.
|
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 SimpleGraph<Vertex,Edge> |
GraphUtils.createCompleteGraph(int n,
boolean directed)
Creates a complete graph Kn of n vertices.
|
static SimpleGraph<Vertex,Edge> |
GraphUtils.createRandomGraph(int n,
boolean directed)
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.
|
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 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> |
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 . |