Modifier and Type | Method and Description |
---|---|
DirectedGraph<?,?> |
GraphLayoutConnection.getGraph() |
Constructor and Description |
---|
GraphLayoutConnection(DirectedGraph<?,?> graph) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractDirectedGraph<N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
Modifier and Type | Method and Description |
---|---|
DirectedGraph<?,?> |
DirectedGraphElement.getGraph() |
Modifier and Type | Method and Description |
---|---|
protected abstract java.util.Map<? extends DirectedGraphElement,? extends DirectedGraphElement> |
AbstractDirectedGraph.cloneFrom(DirectedGraph<N,E> graph)
The returned mapping satisfies:
map.keySet().containsAll(graph.getNodes()) and
map.keySet().containsAll(graph.getEdges())
|
int |
AbstractDirectedGraph.compareTo(DirectedGraph<N,E> o) |
Modifier and Type | Method and Description |
---|---|
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ComponentFactory.buggedComponentize(DirectedGraph<N,E> graph) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ShortestPathFactory.calculateAllShortestDistanceDijkstra(DirectedGraph<N,E> graph) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ComponentFactory.componentize(DirectedGraph<N,E> graph)
Computes strongly connected components for the given directed graph.
|
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
ComponentFactory.isTerminal(DirectedGraph<N,E> graph,
java.util.Collection<N> component)
Checks whether a component is terminal, that is, whether it has no outgoing
edges.
|
Modifier and Type | Method and Description |
---|---|
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDepthFirstPredecessors(N node,
DirectedGraph<N,E> graph,
GraphIterator.EdgeAcceptor<N,E> edgeAcceptor,
GraphIterator.NodeAcceptor<N> nodeAcceptor) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDepthFirstSuccessors(N node,
DirectedGraph<N,E> graph,
GraphIterator.EdgeAcceptor<N,E> edgeAcceptor,
GraphIterator.NodeAcceptor<N> nodeAcceptor) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDirectPredecessors(N node,
DirectedGraph<N,E> graph) |
static <N extends DirectedGraphNode,E extends DirectedGraphEdge<? extends N,? extends N>> |
GraphIterator.getDirectSuccessors(N node,
DirectedGraph<N,E> graph) |