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 connectsnodeUtonodeV(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 connectsnodeUtonodeV, if one is present; otherwise, returnsdefaultValue.booleanhasEdgeConnecting(EndpointPair<N> endpoints) Returns true if there is an edge that directly connectsendpoints(in the order, if any, specified byendpoints).booleanhasEdgeConnecting(N nodeU, N nodeV) Returns true if there is an edge that directly connectsnodeUtonodeV.intReturns the count ofnode's incoming edges (equal topredecessors(node).size()) in a directed graph.intReturns the count ofnode's outgoing edges (equal tosuccessors(node).size()) in a directed graph.predecessors(N node) Returns all nodes in this graph adjacent tonodewhich can be reached by traversingnode's incoming edges against the direction (if any) of the edge.successors(N node) Returns all nodes in this graph adjacent tonodewhich 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, nodesMethods inherited from class com.google.common.graph.AbstractValueGraph
asGraph, equals, hashCode, toStringMethods inherited from class com.google.common.graph.AbstractBaseGraph
edges, incidentEdges, isOrderingCompatible, validateEndpointsMethods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods 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:
delegatein classForwardingValueGraph<N,V>
-
predecessors
Description copied from interface:ValueGraphReturns all nodes in this graph adjacent tonodewhich 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).- Specified by:
predecessorsin interfaceBaseGraph<N>- Specified by:
predecessorsin interfacePredecessorsFunction<N>- Specified by:
predecessorsin interfaceValueGraph<N,V> - Overrides:
predecessorsin classForwardingValueGraph<N,V>
-
successors
Description copied from interface:ValueGraphReturns all nodes in this graph adjacent tonodewhich 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
nodeby following outgoing edges". For that functionality, seeGraphs.reachableNodes(Graph, Object).- Specified by:
successorsin interfaceBaseGraph<N>- Specified by:
successorsin interfaceSuccessorsFunction<N>- Specified by:
successorsin interfaceValueGraph<N,V> - Overrides:
successorsin classForwardingValueGraph<N,V>
-
inDegree
Description copied from interface:BaseGraphReturns 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:BaseGraphReturns 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:BaseGraphReturns true if there is an edge that directly connectsnodeUtonodeV. This is equivalent tonodes().contains(nodeU) && successors(nodeU).contains(nodeV).In an undirected graph, this is equal to
hasEdgeConnecting(nodeV, nodeU).- Specified by:
hasEdgeConnectingin interfaceBaseGraph<N>- Specified by:
hasEdgeConnectingin interfaceValueGraph<N,V> - Overrides:
hasEdgeConnectingin classForwardingValueGraph<N,V>
-
hasEdgeConnecting
Description copied from interface:BaseGraphReturns 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 ofCollection#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 withedges().contains(endpoints).- Specified by:
hasEdgeConnectingin interfaceBaseGraph<N>- Specified by:
hasEdgeConnectingin interfaceValueGraph<N,V> - Overrides:
hasEdgeConnectingin classForwardingValueGraph<N,V>
-
edgeValue
Description copied from interface:ValueGraphReturns the value of the edge that connectsnodeUtonodeV(in the order, if any, specified byendpoints), if one is present; otherwise, returnsOptional.empty().- Specified by:
edgeValuein interfaceValueGraph<N,V> - Overrides:
edgeValuein classForwardingValueGraph<N,V>
-
edgeValue
Description copied from interface:ValueGraphReturns 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:
edgeValuein interfaceValueGraph<N,V> - Overrides:
edgeValuein classForwardingValueGraph<N,V>
-
edgeValueOrDefault
Description copied from interface:ValueGraphReturns the value of the edge that connectsnodeUtonodeV, if one is present; otherwise, returnsdefaultValue.In an undirected graph, this is equal to
edgeValueOrDefault(nodeV, nodeU, defaultValue).- Specified by:
edgeValueOrDefaultin interfaceValueGraph<N,V> - Overrides:
edgeValueOrDefaultin classForwardingValueGraph<N,V>
-
edgeValueOrDefault
Description copied from interface:ValueGraphReturns 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:
edgeValueOrDefaultin interfaceValueGraph<N,V> - Overrides:
edgeValueOrDefaultin classForwardingValueGraph<N,V>
-