Class ForwardingGraph<N>
- All Implemented Interfaces:
BaseGraph<N>
,Graph<N>
,PredecessorsFunction<N>
,SuccessorsFunction<N>
- Direct Known Subclasses:
Graphs.TransposedGraph
,ImmutableGraph
,StandardMutableGraph
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionadjacentNodes
(N node) Returns a live view of the nodes which have an incident edge in common withnode
in this graph.boolean
Returns true if this graph allows self-loops (edges that connect a node to itself).int
Returns the count ofnode
's incident edges, counting self-loops twice (equivalently, the number of times an edge touchesnode
).delegate()
protected long
Defer toAbstractBaseGraph.edges()
(based onsuccessors(Object)
) for full edges() implementation.boolean
hasEdgeConnecting
(EndpointPair<N> endpoints) Returns true if there is an edge that directly connectsendpoints
(in the order, if any, specified byendpoints
).boolean
hasEdgeConnecting
(N nodeU, N nodeV) Returns true if there is an edge that directly connectsnodeU
tonodeV
.Returns anElementOrder
that specifies the order of iteration for the elements ofBaseGraph.edges()
,BaseGraph.adjacentNodes(Object)
,BaseGraph.predecessors(Object)
,BaseGraph.successors(Object)
andBaseGraph.incidentEdges(Object)
.Set
<EndpointPair<N>> incidentEdges
(N node) Returns a live view of the edges in this graph whose endpoints includenode
.int
Returns the count ofnode
's incoming edges (equal topredecessors(node).size()
) in a directed graph.boolean
Returns true if the edges in this graph are directed.Returns the order of iteration for the elements ofGraph.nodes()
.nodes()
Returns all nodes in this graph, in the order specified byGraph.nodeOrder()
.int
Returns the count ofnode
's outgoing edges (equal tosuccessors(node).size()
) in a directed graph.predecessors
(N node) Returns a live view of all nodes in this graph adjacent tonode
which can be reached by traversingnode
's incoming edges against the direction (if any) of the edge.successors
(N node) Returns a live view of all nodes in this graph adjacent tonode
which can be reached by traversingnode
's outgoing edges in the direction (if any) of the edge.Methods inherited from class com.google.common.graph.AbstractGraph
equals, hashCode, toString
Methods inherited from class com.google.common.graph.AbstractBaseGraph
edges, isOrderingCompatible, nodeInvalidatableSet, nodePairInvalidatableSet, validateEndpoints
-
Constructor Details
-
ForwardingGraph
ForwardingGraph()
-
-
Method Details
-
delegate
-
nodes
Description copied from interface:Graph
Returns all nodes in this graph, in the order specified byGraph.nodeOrder()
. -
edgeCount
protected long edgeCount()Defer toAbstractBaseGraph.edges()
(based onsuccessors(Object)
) for full edges() implementation.- Overrides:
edgeCount
in classAbstractBaseGraph<N>
-
isDirected
public boolean isDirected()Description copied from interface:Graph
Returns true if the edges in this graph are directed. Directed edges connect asource node
to atarget node
, while undirected edges connect a pair of nodes to each other. -
allowsSelfLoops
public boolean allowsSelfLoops()Description copied from interface:Graph
Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting to add a self-loop to a graph that does not allow them will throw anIllegalArgumentException
. -
nodeOrder
Description copied from interface:Graph
Returns the order of iteration for the elements ofGraph.nodes()
. -
incidentEdgeOrder
Description copied from interface:BaseGraph
Returns anElementOrder
that specifies the order of iteration for the elements ofBaseGraph.edges()
,BaseGraph.adjacentNodes(Object)
,BaseGraph.predecessors(Object)
,BaseGraph.successors(Object)
andBaseGraph.incidentEdges(Object)
.- Specified by:
incidentEdgeOrder
in interfaceBaseGraph<N>
- Specified by:
incidentEdgeOrder
in interfaceGraph<N>
- Overrides:
incidentEdgeOrder
in classAbstractBaseGraph<N>
-
adjacentNodes
Description copied from interface:Graph
Returns a live view of the nodes which have an incident edge in common withnode
in this graph.This is equal to the union of
Graph.predecessors(Object)
andGraph.successors(Object)
.If
node
is removed from the graph after this method is called, theSet
view
returned by this method will be invalidated, and will throwIllegalStateException
if it is accessed in any way, with the following exceptions:view.equals(view)
evaluates totrue
(but any other `equals()` expression involvingview
will throw)hashCode()
does not throw- if
node
is re-added to the graph after having been removed,view
's behavior is undefined
-
predecessors
Description copied from interface:Graph
Returns a live view of all nodes in this graph adjacent tonode
which can be reached by traversingnode
's incoming edges against the direction (if any) of the edge.In an undirected graph, this is equivalent to
Graph.adjacentNodes(Object)
.If
node
is removed from the graph after this method is called, theSet
view
returned by this method will be invalidated, and will throwIllegalStateException
if it is accessed in any way, with the following exceptions:view.equals(view)
evaluates totrue
(but any other `equals()` expression involvingview
will throw)hashCode()
does not throw- if
node
is re-added to the graph after having been removed,view
's behavior is undefined
-
successors
Description copied from interface:Graph
Returns a live view of all nodes in this graph adjacent tonode
which can be reached by traversingnode
'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, seeGraphs.reachableNodes(Graph, Object)
.If
node
is removed from the graph after this method is called, theSet
view
returned by this method will be invalidated, and will throwIllegalStateException
if it is accessed in any way, with the following exceptions:view.equals(view)
evaluates totrue
(but any other `equals()` expression involvingview
will throw)hashCode()
does not throw- if
node
is re-added to the graph after having been removed,view
's behavior is undefined
-
incidentEdges
Description copied from interface:BaseGraph
Returns a live view of the edges in this graph whose endpoints includenode
.This is equal to the union of incoming and outgoing edges.
If
node
is removed from the graph after this method is called, theSet
view
returned by this method will be invalidated, and will throwIllegalStateException
if it is accessed in any way, with the following exceptions:view.equals(view)
evaluates totrue
(but any other `equals()` expression involvingview
will throw)hashCode()
does not throw- if
node
is re-added to the graph after having been removed,view
's behavior is undefined
- Specified by:
incidentEdges
in interfaceBaseGraph<N>
- Specified by:
incidentEdges
in interfaceGraph<N>
- Overrides:
incidentEdges
in classAbstractBaseGraph<N>
-
degree
Description copied from interface:BaseGraph
Returns the count ofnode
's incident edges, counting self-loops twice (equivalently, the number of times an edge touchesnode
).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 tonode
).If the count is greater than
Integer.MAX_VALUE
, returnsInteger.MAX_VALUE
. -
inDegree
Description copied from interface:BaseGraph
Returns the count ofnode
's incoming edges (equal topredecessors(node).size()
) in a directed graph. In an undirected graph, returns theBaseGraph.degree(Object)
.If the count is greater than
Integer.MAX_VALUE
, returnsInteger.MAX_VALUE
. -
outDegree
Description copied from interface:BaseGraph
Returns the count ofnode
's outgoing edges (equal tosuccessors(node).size()
) in a directed graph. In an undirected graph, returns theBaseGraph.degree(Object)
.If the count is greater than
Integer.MAX_VALUE
, returnsInteger.MAX_VALUE
. -
hasEdgeConnecting
Description copied from interface:BaseGraph
Returns true if there is an edge that directly connectsnodeU
tonodeV
. This is equivalent tonodes().contains(nodeU) && successors(nodeU).contains(nodeV)
.In an undirected graph, this is equal to
hasEdgeConnecting(nodeV, nodeU)
.- Specified by:
hasEdgeConnecting
in interfaceBaseGraph<N>
- Specified by:
hasEdgeConnecting
in interfaceGraph<N>
- Overrides:
hasEdgeConnecting
in classAbstractBaseGraph<N>
-
hasEdgeConnecting
Description copied from interface:BaseGraph
Returns true if there is an edge that directly connectsendpoints
(in the order, if any, specified byendpoints
). This is equivalent toedges().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 ofinvalid reference
Collection#contains(Object)
edges().contains(endpoints)
.- Specified by:
hasEdgeConnecting
in interfaceBaseGraph<N>
- Specified by:
hasEdgeConnecting
in interfaceGraph<N>
- Overrides:
hasEdgeConnecting
in classAbstractBaseGraph<N>
-