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()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.Set<EndpointPair<N>>incidentEdges(N node) Returns the edges in this graph whose endpoints includenode.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.ForwardingGraph
adjacentNodes, allowsSelfLoops, degree, edgeCount, incidentEdgeOrder, isDirected, nodeOrder, nodesMethods inherited from class com.google.common.graph.AbstractGraph
equals, hashCode, toStringMethods inherited from class com.google.common.graph.AbstractBaseGraph
edges, isOrderingCompatible, validateEndpoints
-
Field Details
-
graph
-
-
Constructor Details
-
TransposedGraph
-
-
Method Details
-
delegate
- Specified by:
delegatein classForwardingGraph<N>
-
predecessors
Description copied from interface:GraphReturns 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
Graph.adjacentNodes(Object).- Specified by:
predecessorsin interfaceBaseGraph<N>- Specified by:
predecessorsin interfaceGraph<N>- Specified by:
predecessorsin interfacePredecessorsFunction<N>- Overrides:
predecessorsin classForwardingGraph<N>
-
successors
Description copied from interface:GraphReturns 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
Graph.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 interfaceGraph<N>- Specified by:
successorsin interfaceSuccessorsFunction<N>- Overrides:
successorsin classForwardingGraph<N>
-
incidentEdges
Description copied from interface:BaseGraphReturns the edges in this graph whose endpoints includenode.This is equal to the union of incoming and outgoing edges.
- Specified by:
incidentEdgesin interfaceBaseGraph<N>- Specified by:
incidentEdgesin interfaceGraph<N>- Overrides:
incidentEdgesin classForwardingGraph<N>
-
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 interfaceGraph<N>- Overrides:
hasEdgeConnectingin classForwardingGraph<N>
-
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 interfaceGraph<N>- Overrides:
hasEdgeConnectingin classForwardingGraph<N>
-