Class Graphs.TransposedGraph<N>
- All Implemented Interfaces:
BaseGraph<N>
,Graph<N>
,PredecessorsFunction<N>
,SuccessorsFunction<N>
- Enclosing class:
Graphs
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiondelegate()
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
.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.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.ForwardingGraph
adjacentNodes, allowsSelfLoops, degree, edgeCount, incidentEdgeOrder, isDirected, nodeOrder, nodes
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
-
Field Details
-
graph
-
-
Constructor Details
-
TransposedGraph
-
-
Method Details
-
delegate
- Specified by:
delegate
in classForwardingGraph<N>
-
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
- Specified by:
predecessors
in interfaceBaseGraph<N>
- Specified by:
predecessors
in interfaceGraph<N>
- Specified by:
predecessors
in interfacePredecessorsFunction<N>
- Overrides:
predecessors
in classForwardingGraph<N>
-
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
- Specified by:
successors
in interfaceBaseGraph<N>
- Specified by:
successors
in interfaceGraph<N>
- Specified by:
successors
in interfaceSuccessorsFunction<N>
- Overrides:
successors
in classForwardingGraph<N>
-
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 classForwardingGraph<N>
-
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 classForwardingGraph<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 classForwardingGraph<N>
-