Class Graphs.TransposedValueGraph<N,V>
- All Implemented Interfaces:
BaseGraph<N>
,PredecessorsFunction<N>
,SuccessorsFunction<N>
,ValueGraph<N,
V>
- Enclosing class:
Graphs
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescription(package private) ValueGraph
<N, V> delegate()
edgeValue
(EndpointPair<N> endpoints) Returns the value of the edge that connectsendpoints
(in the order, if any, specified byendpoints
), if one is present; otherwise, returnsOptional.empty()
.Returns the value of the edge that connectsnodeU
tonodeV
(in the order, if any, specified byendpoints
), if one is present; otherwise, returnsOptional.empty()
.edgeValueOrDefault
(EndpointPair<N> endpoints, V defaultValue) Returns the value of the edge that connectsendpoints
(in the order, if any, specified byendpoints
), if one is present; otherwise, returnsdefaultValue
.edgeValueOrDefault
(N nodeU, N nodeV, V defaultValue) Returns the value of the edge that connectsnodeU
tonodeV
, if one is present; otherwise, returnsdefaultValue
.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
.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.ForwardingValueGraph
adjacentNodes, allowsSelfLoops, degree, edgeCount, incidentEdgeOrder, isDirected, nodeOrder, nodes
Methods inherited from class com.google.common.graph.AbstractValueGraph
asGraph, equals, hashCode, toString
Methods inherited from class com.google.common.graph.AbstractBaseGraph
edges, incidentEdges, isOrderingCompatible, nodeInvalidatableSet, nodePairInvalidatableSet, validateEndpoints
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface com.google.common.graph.ValueGraph
edges, incidentEdges
-
Field Details
-
graph
-
-
Constructor Details
-
TransposedValueGraph
TransposedValueGraph(ValueGraph<N, V> graph)
-
-
Method Details
-
delegate
ValueGraph<N,V> delegate()- Specified by:
delegate
in classForwardingValueGraph<N,
V>
-
predecessors
Description copied from interface:ValueGraph
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
ValueGraph.adjacentNodes(Object)
.If
node
is removed from the graph after this method is called, the `Set` returned by this method will be invalidated, and will throw `IllegalStateException` if it is accessed in any way.- Specified by:
predecessors
in interfaceBaseGraph<N>
- Specified by:
predecessors
in interfacePredecessorsFunction<N>
- Specified by:
predecessors
in interfaceValueGraph<N,
V> - Overrides:
predecessors
in classForwardingValueGraph<N,
V>
-
successors
Description copied from interface:ValueGraph
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
ValueGraph.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 interfaceSuccessorsFunction<N>
- Specified by:
successors
in interfaceValueGraph<N,
V> - Overrides:
successors
in classForwardingValueGraph<N,
V>
-
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 interfaceValueGraph<N,
V> - Overrides:
hasEdgeConnecting
in classForwardingValueGraph<N,
V>
-
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 interfaceValueGraph<N,
V> - Overrides:
hasEdgeConnecting
in classForwardingValueGraph<N,
V>
-
edgeValue
Description copied from interface:ValueGraph
Returns the value of the edge that connectsnodeU
tonodeV
(in the order, if any, specified byendpoints
), if one is present; otherwise, returnsOptional.empty()
.- Specified by:
edgeValue
in interfaceValueGraph<N,
V> - Overrides:
edgeValue
in classForwardingValueGraph<N,
V>
-
edgeValue
Description copied from interface:ValueGraph
Returns the value of the edge that connectsendpoints
(in the order, if any, specified byendpoints
), if one is present; otherwise, returnsOptional.empty()
.If this graph is directed, the endpoints must be ordered.
- Specified by:
edgeValue
in interfaceValueGraph<N,
V> - Overrides:
edgeValue
in classForwardingValueGraph<N,
V>
-
edgeValueOrDefault
Description copied from interface:ValueGraph
Returns the value of the edge that connectsnodeU
tonodeV
, if one is present; otherwise, returnsdefaultValue
.In an undirected graph, this is equal to
edgeValueOrDefault(nodeV, nodeU, defaultValue)
.- Specified by:
edgeValueOrDefault
in interfaceValueGraph<N,
V> - Overrides:
edgeValueOrDefault
in classForwardingValueGraph<N,
V>
-
edgeValueOrDefault
Description copied from interface:ValueGraph
Returns the value of the edge that connectsendpoints
(in the order, if any, specified byendpoints
), if one is present; otherwise, returnsdefaultValue
.If this graph is directed, the endpoints must be ordered.
- Specified by:
edgeValueOrDefault
in interfaceValueGraph<N,
V> - Overrides:
edgeValueOrDefault
in classForwardingValueGraph<N,
V>
-