Package com.google.common.graph

Class Graphs.TransposedValueGraph<N,V>

java.lang.Object

com.google.common.graph.AbstractBaseGraph<N>

com.google.common.graph.AbstractValueGraph<N,V>

com.google.common.graph.ForwardingValueGraph<N,V>

com.google.common.graph.Graphs.TransposedValueGraph<N,V>

All Implemented Interfaces:

BaseGraph<N>, PredecessorsFunction<N>, SuccessorsFunction<N>, ValueGraph<N,V>

Enclosing class:

Graphs

private static class Graphs.TransposedValueGraph<N,V>
extends ForwardingValueGraph<N,V>

Field Summary

Fields

Modifier and Type	Field	Description
private ValueGraph<N,V>	graph

Constructor Summary

Constructors

Constructor	Description
TransposedValueGraph(ValueGraph<N,V> graph)

Method Summary

Modifier and Type	Method	Description
protected ValueGraph<N,V>	delegate()
java.util.Optional<V>	edgeValue(EndpointPair<N> endpoints)	Returns the value of the edge that connects endpoints (in the order, if any, specified by endpoints), if one is present; otherwise, returns Optional.empty().
java.util.Optional<V>	edgeValue(N nodeU, N nodeV)	Returns the value of the edge that connects nodeU to nodeV (in the order, if any, specified by endpoints), if one is present; otherwise, returns Optional.empty().
V	edgeValueOrDefault(EndpointPair<N> endpoints, V defaultValue)	Returns the value of the edge that connects endpoints (in the order, if any, specified by endpoints), if one is present; otherwise, returns defaultValue.
V	edgeValueOrDefault(N nodeU, N nodeV, V defaultValue)	Returns the value of the edge that connects nodeU to nodeV, if one is present; otherwise, returns defaultValue.
boolean	hasEdgeConnecting(EndpointPair<N> endpoints)	Returns true if there is an edge that directly connects endpoints (in the order, if any, specified by endpoints).
boolean	hasEdgeConnecting(N nodeU, N nodeV)	Returns true if there is an edge that directly connects nodeU to nodeV.
int	inDegree(N node)	Returns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph.
int	outDegree(N node)	Returns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph.
java.util.Set<N>	predecessors(N node)	Returns all nodes in this graph adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge.
java.util.Set<N>	successors(N node)	Returns all nodes in this graph adjacent to node which can be reached by traversing node'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, 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 Detail

graph

private final ValueGraph<N,V> graph

Constructor Detail

TransposedValueGraph

TransposedValueGraph(ValueGraph<N,V> graph)

Method Detail

delegate

protected ValueGraph<N,V> delegate()

Specified by:

delegate in class ForwardingValueGraph<N,V>

predecessors

public java.util.Set<N> predecessors(N node)

Description copied from interface: ValueGraph

Returns all nodes in this graph adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge.

In an undirected graph, this is equivalent to ValueGraph.adjacentNodes(Object).

Specified by:

predecessors in interface BaseGraph<N>

Specified by:

predecessors in interface PredecessorsFunction<N>

Specified by:

predecessors in interface ValueGraph<N,V>

Overrides:

predecessors in class ForwardingValueGraph<N,V>

successors

public java.util.Set<N> successors(N node)

Description copied from interface: ValueGraph

Returns all nodes in this graph adjacent to node which can be reached by traversing node'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, see Graphs.reachableNodes(Graph, Object).

Specified by:

successors in interface BaseGraph<N>

Specified by:

successors in interface SuccessorsFunction<N>

Specified by:

successors in interface ValueGraph<N,V>

Overrides:

successors in class ForwardingValueGraph<N,V>

inDegree

public int inDegree(N node)

Description copied from interface: BaseGraph

Returns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph. In an undirected graph, returns the BaseGraph.degree(Object).

If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.

Specified by:

inDegree in interface BaseGraph<N>

Specified by:

inDegree in interface ValueGraph<N,V>

Overrides:

inDegree in class ForwardingValueGraph<N,V>

outDegree

public int outDegree(N node)

Description copied from interface: BaseGraph

Returns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph. In an undirected graph, returns the BaseGraph.degree(Object).

If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.

Specified by:

outDegree in interface BaseGraph<N>

Specified by:

outDegree in interface ValueGraph<N,V>

Overrides:

outDegree in class ForwardingValueGraph<N,V>

hasEdgeConnecting

public boolean hasEdgeConnecting(N nodeU,
                                 N nodeV)

Description copied from interface: BaseGraph

Returns true if there is an edge that directly connects nodeU to nodeV. This is equivalent to nodes().contains(nodeU) && successors(nodeU).contains(nodeV).

In an undirected graph, this is equal to hasEdgeConnecting(nodeV, nodeU).

Specified by:

hasEdgeConnecting in interface BaseGraph<N>

Specified by:

hasEdgeConnecting in interface ValueGraph<N,V>

Overrides:

hasEdgeConnecting in class ForwardingValueGraph<N,V>

hasEdgeConnecting

public boolean hasEdgeConnecting(EndpointPair<N> endpoints)

Description copied from interface: BaseGraph

Returns true if there is an edge that directly connects endpoints (in the order, if any, specified by endpoints). This is equivalent to edges().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 of Collection#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 with edges().contains(endpoints).

Specified by:

hasEdgeConnecting in interface BaseGraph<N>

Specified by:

hasEdgeConnecting in interface ValueGraph<N,V>

Overrides:

hasEdgeConnecting in class ForwardingValueGraph<N,V>

edgeValue

public java.util.Optional<V> edgeValue(N nodeU,
                                       N nodeV)

Description copied from interface: ValueGraph

Returns the value of the edge that connects nodeU to nodeV (in the order, if any, specified by endpoints), if one is present; otherwise, returns Optional.empty().

Specified by:

edgeValue in interface ValueGraph<N,V>

Overrides:

edgeValue in class ForwardingValueGraph<N,V>

edgeValue

public java.util.Optional<V> edgeValue(EndpointPair<N> endpoints)

Description copied from interface: ValueGraph

Returns the value of the edge that connects endpoints (in the order, if any, specified by endpoints), if one is present; otherwise, returns Optional.empty().

If this graph is directed, the endpoints must be ordered.

Specified by:

edgeValue in interface ValueGraph<N,V>

Overrides:

edgeValue in class ForwardingValueGraph<N,V>

edgeValueOrDefault

public V edgeValueOrDefault(N nodeU,
                            N nodeV,
                            V defaultValue)

Description copied from interface: ValueGraph

Returns the value of the edge that connects nodeU to nodeV, if one is present; otherwise, returns defaultValue.

In an undirected graph, this is equal to edgeValueOrDefault(nodeV, nodeU, defaultValue).

Specified by:

edgeValueOrDefault in interface ValueGraph<N,V>

Overrides:

edgeValueOrDefault in class ForwardingValueGraph<N,V>

edgeValueOrDefault

public V edgeValueOrDefault(EndpointPair<N> endpoints,
                            V defaultValue)

Description copied from interface: ValueGraph

Returns the value of the edge that connects endpoints (in the order, if any, specified by endpoints), if one is present; otherwise, returns defaultValue.

If this graph is directed, the endpoints must be ordered.

Specified by:

edgeValueOrDefault in interface ValueGraph<N,V>

Overrides:

edgeValueOrDefault in class ForwardingValueGraph<N,V>