Package com.google.common.graph

Class Graphs.TransposedGraph<N>

java.lang.Object

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

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

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

com.google.common.graph.Graphs.TransposedGraph<N>

All Implemented Interfaces:

BaseGraph<N>, Graph<N>, PredecessorsFunction<N>, SuccessorsFunction<N>

Enclosing class:

Graphs

private static class Graphs.TransposedGraph<N>
extends ForwardingGraph<N>

Field Summary

Fields

Modifier and Type	Field	Description
private Graph<N>	graph

Constructor Summary

Constructors

Constructor	Description
TransposedGraph(Graph<N> graph)

Method Summary

Modifier and Type	Method	Description
protected Graph<N>	delegate()
boolean	hasEdgeConnecting(N nodeU, N nodeV)	Returns true if there is an edge directly connecting 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.ForwardingGraph

adjacentNodes, allowsSelfLoops, degree, edgeCount, 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, incidentEdges

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.google.common.graph.Graph

edges, incidentEdges

Field Detail

graph

private final Graph<N> graph

Constructor Detail

TransposedGraph

TransposedGraph(Graph<N> graph)

Method Detail

delegate

protected Graph<N> delegate()

Specified by:

delegate in class ForwardingGraph<N>

predecessors

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

Description copied from interface: Graph

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 Graph.adjacentNodes(Object).

Specified by:

predecessors in interface BaseGraph<N>

Specified by:

predecessors in interface Graph<N>

Specified by:

predecessors in interface PredecessorsFunction<N>

Overrides:

predecessors in class ForwardingGraph<N>

successors

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

Description copied from interface: Graph

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 Graph.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 Graph<N>

Specified by:

successors in interface SuccessorsFunction<N>

Overrides:

successors in class ForwardingGraph<N>

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 Graph<N>

Overrides:

inDegree in class ForwardingGraph<N>

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 Graph<N>

Overrides:

outDegree in class ForwardingGraph<N>

hasEdgeConnecting

public boolean hasEdgeConnecting(N nodeU,
                                 N nodeV)

Description copied from interface: BaseGraph

Returns true if there is an edge directly connecting 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 Graph<N>

Overrides:

hasEdgeConnecting in class ForwardingGraph<N>