abstract class ForwardingGraph<N> extends AbstractGraph<N>
| Constructor and Description |
|---|
ForwardingGraph() |
| Modifier and Type | Method and Description |
|---|---|
java.util.Set<N> |
adjacentNodes(N node)
Returns the nodes which have an incident edge in common with
node in this graph. |
boolean |
allowsSelfLoops()
Returns true if this graph allows self-loops (edges that connect a node to itself).
|
int |
degree(N node)
Returns the count of
node's incident edges, counting self-loops twice (equivalently,
the number of times an edge touches node). |
protected abstract BaseGraph<N> |
delegate() |
protected long |
edgeCount()
Defer to
AbstractBaseGraph.edges() (based on successors(Object)) for full edges()
implementation. |
boolean |
hasEdgeConnecting(N nodeU,
N nodeV)
Returns true if there is an edge directly connecting
nodeU to nodeV. |
int |
inDegree(N node)
Returns the count of
node's incoming edges (equal to predecessors(node).size())
in a directed graph. |
boolean |
isDirected()
Returns true if the edges in this graph are directed.
|
ElementOrder<N> |
nodeOrder()
Returns the order of iteration for the elements of
Graph.nodes(). |
java.util.Set<N> |
nodes()
Returns all nodes in this graph, in the order specified by
Graph.nodeOrder(). |
int |
outDegree(N node)
Returns the count of
node's outgoing edges (equal to successors(node).size())
in a directed graph. |
java.util.Set<N> |
predecessors(N node)
Returns all nodes in this graph adjacent to
node which can be reached by traversing
node's incoming edges against the direction (if any) of the edge. |
java.util.Set<N> |
successors(N node)
Returns all nodes in this graph adjacent to
node which can be reached by traversing
node's outgoing edges in the direction (if any) of the edge. |
equals, hashCode, toStringedges, incidentEdgesclone, finalize, getClass, notify, notifyAll, wait, wait, waitedges, incidentEdgespublic java.util.Set<N> nodes()
GraphGraph.nodeOrder().protected long edgeCount()
AbstractBaseGraph.edges() (based on successors(Object)) for full edges()
implementation.edgeCount in class AbstractBaseGraph<N>public boolean isDirected()
Graphsource node to a target node, while
undirected edges connect a pair of nodes to each other.public boolean allowsSelfLoops()
GraphIllegalArgumentException.public ElementOrder<N> nodeOrder()
GraphGraph.nodes().public java.util.Set<N> adjacentNodes(N node)
Graphnode in this graph.public java.util.Set<N> predecessors(N node)
Graphnode which can be reached by traversing
node's incoming edges against the direction (if any) of the edge.
In an undirected graph, this is equivalent to Graph.adjacentNodes(Object).
public java.util.Set<N> successors(N node)
Graphnode which can be reached by traversing
node's outgoing edges in the direction (if any) of the edge.
In an undirected graph, this is equivalent to Graph.adjacentNodes(Object).
This is not the same as "all nodes reachable from node by following outgoing
edges". For that functionality, see Graphs.reachableNodes(Graph, Object).
public int degree(N node)
BaseGraphnode's incident edges, counting self-loops twice (equivalently,
the number of times an edge touches node).
For directed graphs, this is equal to inDegree(node) + outDegree(node).
For undirected graphs, this is equal to incidentEdges(node).size() + (number of
self-loops incident to node).
If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.
public int inDegree(N node)
BaseGraphnode's incoming edges (equal to predecessors(node).size())
in a directed graph. In an undirected graph, returns the BaseGraph.degree(Object).
If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.
public int outDegree(N node)
BaseGraphnode's outgoing edges (equal to successors(node).size())
in a directed graph. In an undirected graph, returns the BaseGraph.degree(Object).
If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.
public boolean hasEdgeConnecting(N nodeU, N nodeV)
BaseGraphnodeU to nodeV. This is
equivalent to nodes().contains(nodeU) && successors(nodeU).contains(nodeV).
In an undirected graph, this is equal to hasEdgeConnecting(nodeV, nodeU).
hasEdgeConnecting in interface BaseGraph<N>hasEdgeConnecting in interface Graph<N>hasEdgeConnecting in class AbstractBaseGraph<N>