Package com.google.common.graph

Class Graphs.TransposedValueGraph<N,​V>

    • Field Summary

      Fields 
      Modifier and Type Field Description
      private ValueGraph<N,​V> 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 with node in this graph.
      boolean allowsSelfLoops()
      Returns true if this graph allows self-loops (edges that connect a node to itself).
      protected long edgeCount()
      Defer to AbstractGraph.edges() (based on successors(Object)) for full edges() implementation.
      V edgeValue​(java.lang.Object nodeU, java.lang.Object nodeV)
      If there is an edge connecting nodeU to nodeV, returns the non-null value associated with that edge.
      V edgeValueOrDefault​(java.lang.Object nodeU, java.lang.Object nodeV, V defaultValue)
      If there is an edge connecting nodeU to nodeV, returns the non-null value associated with that edge; otherwise, returns defaultValue.
      boolean isDirected()
      Returns true if the edges in this graph are directed.
      ElementOrder<N> nodeOrder()
      Returns the order of iteration for the elements of Graph.nodes().
      java.util.Set<N> nodes()
      Returns all nodes in this graph, in the order specified by Graph.nodeOrder().
      java.util.Set<N> predecessors​(java.lang.Object 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​(java.lang.Object 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 java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

    • Constructor Detail

      • TransposedValueGraph

        TransposedValueGraph​(ValueGraph<N,​V> graph)

    • Method Detail

      • nodes

        public java.util.Set<N> nodes()
        Description copied from interface: Graph
        Returns all nodes in this graph, in the order specified by Graph.nodeOrder().

      • isDirected

        public boolean isDirected()
        Description copied from interface: Graph
        Returns true if the edges in this graph are directed. Directed edges connect a source node to a target 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 an UnsupportedOperationException.

      • nodeOrder

        public ElementOrder<N> nodeOrder()
        Description copied from interface: Graph
        Returns the order of iteration for the elements of Graph.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 with node 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 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).

      • successors

        public java.util.Set<N> successors​(java.lang.Object 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).

      • edgeValue

        public V edgeValue​(java.lang.Object nodeU,
                   java.lang.Object nodeV)
        Description copied from interface: ValueGraph
        If there is an edge connecting nodeU to nodeV, returns the non-null value associated with that edge.

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

        Specified by:
        edgeValue in interface ValueGraph<N,​V>
        Overrides:
        edgeValue in class AbstractValueGraph<N,​V>

      • edgeValueOrDefault

        public V edgeValueOrDefault​(java.lang.Object nodeU,
                            java.lang.Object nodeV,
                            @Nullable
                            V defaultValue)
        Description copied from interface: ValueGraph
        If there is an edge connecting nodeU to nodeV, returns the non-null value associated with that edge; otherwise, returns defaultValue.

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