Class 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 Details

    • graph

      private final Graph<N> graph
  • Constructor Details

    • TransposedGraph

      TransposedGraph(Graph<N> graph)
  • Method Details

    • delegate

      Graph<N> delegate()
      Specified by:
      delegate in class ForwardingGraph<N>
    • predecessors

      public Set<N> predecessors(N node)
      Description copied from interface: Graph
      Returns a live view of 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).

      If node is removed from the graph after this method is called, the Set view returned by this method will be invalidated, and will throw IllegalStateException if it is accessed in any way, with the following exceptions:

      • view.equals(view) evaluates to true (but any other `equals()` expression involving view will throw)
      • hashCode() does not throw
      • if node is re-added to the graph after having been removed, view's behavior is undefined
      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 Set<N> successors(N node)
      Description copied from interface: Graph
      Returns a live view of 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).

      If node is removed from the graph after this method is called, the Set view returned by this method will be invalidated, and will throw IllegalStateException if it is accessed in any way, with the following exceptions:

      • view.equals(view) evaluates to true (but any other `equals()` expression involving view will throw)
      • hashCode() does not throw
      • if node is re-added to the graph after having been removed, view's behavior is undefined
      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>
    • incidentEdges

      public Set<EndpointPair<N>> incidentEdges(N node)
      Description copied from interface: BaseGraph
      Returns a live view of the edges in this graph whose endpoints include node.

      This is equal to the union of incoming and outgoing edges.

      If node is removed from the graph after this method is called, the Set view returned by this method will be invalidated, and will throw IllegalStateException if it is accessed in any way, with the following exceptions:

      • view.equals(view) evaluates to true (but any other `equals()` expression involving view will throw)
      • hashCode() does not throw
      • if node is re-added to the graph after having been removed, view's behavior is undefined
      Specified by:
      incidentEdges in interface BaseGraph<N>
      Specified by:
      incidentEdges in interface Graph<N>
      Overrides:
      incidentEdges 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 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 Graph<N>
      Overrides:
      hasEdgeConnecting in class ForwardingGraph<N>
    • 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

      invalid reference
      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 Graph<N>
      Overrides:
      hasEdgeConnecting in class ForwardingGraph<N>