Package com.google.common.graph
Class Graphs.TransposedGraph<N>
- java.lang.Object
-
- com.google.common.graph.AbstractGraph<N>
-
- com.google.common.graph.Graphs.TransposedGraph<N>
-
- All Implemented Interfaces:
Graph<N>
- Enclosing class:
- Graphs
private static class Graphs.TransposedGraph<N> extends AbstractGraph<N>
-
-
Constructor Summary
Constructors Constructor Description TransposedGraph(Graph<N> graph)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.Set<N>
adjacentNodes(java.lang.Object node)
Returns the nodes which have an incident edge in common withnode
in this graph.boolean
allowsSelfLoops()
Returns true if this graph allows self-loops (edges that connect a node to itself).protected long
edgeCount()
Defer toAbstractGraph.edges()
(based onsuccessors(Object)
) for full edges() implementation.boolean
isDirected()
Returns true if the edges in this graph are directed.ElementOrder<N>
nodeOrder()
Returns the order of iteration for the elements ofGraph.nodes()
.java.util.Set<N>
nodes()
Returns all nodes in this graph, in the order specified byGraph.nodeOrder()
.java.util.Set<N>
predecessors(java.lang.Object node)
Returns all nodes in this graph adjacent tonode
which can be reached by traversingnode
's incoming edges against the direction (if any) of the edge.java.util.Set<N>
successors(java.lang.Object node)
Returns 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.AbstractGraph
degree, edges, inDegree, outDegree, toString
-
-
-
-
Method Detail
-
nodes
public java.util.Set<N> nodes()
Description copied from interface:Graph
Returns all nodes in this graph, in the order specified byGraph.nodeOrder()
.
-
edgeCount
protected long edgeCount()
Defer toAbstractGraph.edges()
(based onsuccessors(Object)
) for full edges() implementation.- Overrides:
edgeCount
in classAbstractGraph<N>
-
isDirected
public boolean isDirected()
Description copied from interface:Graph
Returns true if the edges in this graph are directed. Directed edges connect asource node
to atarget node
, while undirected edges connect a pair of nodes to each other.
-
allowsSelfLoops
public boolean allowsSelfLoops()
Description copied from interface:Graph
Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting to add a self-loop to a graph that does not allow them will throw anUnsupportedOperationException
.
-
nodeOrder
public ElementOrder<N> nodeOrder()
Description copied from interface:Graph
Returns the order of iteration for the elements ofGraph.nodes()
.
-
adjacentNodes
public java.util.Set<N> adjacentNodes(java.lang.Object node)
Description copied from interface:Graph
Returns the nodes which have an incident edge in common withnode
in this graph.
-
predecessors
public java.util.Set<N> predecessors(java.lang.Object node)
Description copied from interface:Graph
Returns 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
Graph.adjacentNodes(Object)
.
-
successors
public java.util.Set<N> successors(java.lang.Object node)
Description copied from interface:Graph
Returns 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
Graph.adjacentNodes(Object)
.This is not the same as "all nodes reachable from
node
by following outgoing edges". For that functionality, seeGraphs.reachableNodes(Graph, Object)
.
-
-