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). |
(package private) abstract BaseGraph<N> |
delegate() |
protected long |
edgeCount()
Defer to
AbstractBaseGraph.edges() (based on successors(Object)) for full edges()
implementation. |
boolean |
hasEdgeConnecting(EndpointPair<N> endpoints)
Returns true if there is an edge that directly connects
endpoints (in the order, if
any, specified by endpoints). |
boolean |
hasEdgeConnecting(N nodeU,
N nodeV)
Returns true if there is an edge that directly connects
nodeU to nodeV. |
ElementOrder<N> |
incidentEdgeOrder()
Returns an
ElementOrder that specifies the order of iteration for the elements of
BaseGraph.edges(), BaseGraph.adjacentNodes(Object), BaseGraph.predecessors(Object), BaseGraph.successors(Object) and BaseGraph.incidentEdges(Object). |
java.util.Set<EndpointPair<N>> |
incidentEdges(N node)
Returns the edges in this graph whose endpoints include
node. |
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, isOrderingCompatible, validateEndpointspublic 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 ElementOrder<N> incidentEdgeOrder()
BaseGraphElementOrder that specifies the order of iteration for the elements of
BaseGraph.edges(), BaseGraph.adjacentNodes(Object), BaseGraph.predecessors(Object), BaseGraph.successors(Object) and BaseGraph.incidentEdges(Object).incidentEdgeOrder in interface BaseGraph<N>incidentEdgeOrder in interface Graph<N>incidentEdgeOrder in class AbstractBaseGraph<N>public java.util.Set<N> adjacentNodes(N node)
Graphnode in this graph.
This is equal to the union of Graph.predecessors(Object) and Graph.successors(Object).
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 java.util.Set<EndpointPair<N>> incidentEdges(N node)
BaseGraphnode.
This is equal to the union of incoming and outgoing edges.
incidentEdges in interface BaseGraph<N>incidentEdges in interface Graph<N>incidentEdges in class AbstractBaseGraph<N>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>public boolean hasEdgeConnecting(EndpointPair<N> endpoints)
BaseGraphendpoints (in the order, if
any, specified by endpoints). This is equivalent to edges().contains(endpoints).
Unlike the other EndpointPair-accepting methods, this method does not throw if the
endpoints are unordered; it simply returns false. This is for consistency with the behavior of
Collection#contains(Object) (which does not generally throw if the object cannot be
present in the collection), and the desire to have this method's behavior be compatible with
edges().contains(endpoints).
hasEdgeConnecting in interface BaseGraph<N>hasEdgeConnecting in interface Graph<N>hasEdgeConnecting in class AbstractBaseGraph<N>