Class Graphs.TransposedNetwork<N,​E>

  • All Implemented Interfaces:
    Network<N,​E>
    Enclosing class:
    Graphs

    private static class Graphs.TransposedNetwork<N,​E>
    extends AbstractNetwork<N,​E>
    • Field Summary

      Fields 
      Modifier and Type Field Description
      private Network<N,​E> network  
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      java.util.Set<E> adjacentEdges​(java.lang.Object edge)
      Returns the edges which have an incident node in common with edge.
      java.util.Set<N> adjacentNodes​(java.lang.Object node)
      Returns the nodes which have an incident edge in common with node in this network.
      boolean allowsParallelEdges()
      Returns true if this network allows parallel edges.
      boolean allowsSelfLoops()
      Returns true if this network allows self-loops (edges that connect a node to itself).
      ElementOrder<E> edgeOrder()
      Returns the order of iteration for the elements of Network.edges().
      java.util.Set<E> edges()
      Returns all edges in this network, in the order specified by Network.edgeOrder().
      java.util.Set<E> edgesConnecting​(java.lang.Object nodeU, java.lang.Object nodeV)
      Returns the set of edges directly connecting nodeU to nodeV.
      java.util.Set<E> incidentEdges​(java.lang.Object node)
      Returns the edges whose incident nodes in this network include node.
      EndpointPair<N> incidentNodes​(java.lang.Object edge)
      Returns the nodes which are the endpoints of edge in this network.
      java.util.Set<E> inEdges​(java.lang.Object node)
      Returns all edges in this network which can be traversed in the direction (if any) of the edge to end at node.
      boolean isDirected()
      Returns true if the edges in this network are directed.
      ElementOrder<N> nodeOrder()
      Returns the order of iteration for the elements of Network.nodes().
      java.util.Set<N> nodes()
      Returns all nodes in this network, in the order specified by Network.nodeOrder().
      java.util.Set<E> outEdges​(java.lang.Object node)
      Returns all edges in this network which can be traversed in the direction (if any) of the edge starting from node.
      java.util.Set<N> predecessors​(java.lang.Object node)
      Returns all nodes in this network 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 network 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
    • Field Detail

      • network

        private final Network<N,​E> network
    • Constructor Detail

      • TransposedNetwork

        TransposedNetwork​(Network<N,​E> network)
    • Method Detail

      • nodes

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

        public java.util.Set<E> edges()
        Description copied from interface: Network
        Returns all edges in this network, in the order specified by Network.edgeOrder().
      • isDirected

        public boolean isDirected()
        Description copied from interface: Network
        Returns true if the edges in this network are directed. Directed edges connect a source node to a target node, while undirected edges connect a pair of nodes to each other.
      • allowsParallelEdges

        public boolean allowsParallelEdges()
        Description copied from interface: Network
        Returns true if this network allows parallel edges. Attempting to add a parallel edge to a network that does not allow them will throw an UnsupportedOperationException.
      • allowsSelfLoops

        public boolean allowsSelfLoops()
        Description copied from interface: Network
        Returns true if this network allows self-loops (edges that connect a node to itself). Attempting to add a self-loop to a network that does not allow them will throw an UnsupportedOperationException.
      • adjacentNodes

        public java.util.Set<N> adjacentNodes​(java.lang.Object node)
        Description copied from interface: Network
        Returns the nodes which have an incident edge in common with node in this network.
      • predecessors

        public java.util.Set<N> predecessors​(java.lang.Object node)
        Description copied from interface: Network
        Returns all nodes in this network adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge.

        In an undirected network, this is equivalent to Network.adjacentNodes(Object).

      • successors

        public java.util.Set<N> successors​(java.lang.Object node)
        Description copied from interface: Network
        Returns all nodes in this network adjacent to node which can be reached by traversing node's outgoing edges in the direction (if any) of the edge.

        In an undirected network, this is equivalent to Network.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).

      • incidentEdges

        public java.util.Set<E> incidentEdges​(java.lang.Object node)
        Description copied from interface: Network
        Returns the edges whose incident nodes in this network include node.
      • inEdges

        public java.util.Set<E> inEdges​(java.lang.Object node)
        Description copied from interface: Network
        Returns all edges in this network which can be traversed in the direction (if any) of the edge to end at node.

        In a directed network, an incoming edge's EndpointPair.target() equals node.

        In an undirected network, this is equivalent to Network.incidentEdges(Object).

      • outEdges

        public java.util.Set<E> outEdges​(java.lang.Object node)
        Description copied from interface: Network
        Returns all edges in this network which can be traversed in the direction (if any) of the edge starting from node.

        In a directed network, an outgoing edge's EndpointPair.source() equals node.

        In an undirected network, this is equivalent to Network.incidentEdges(Object).

      • incidentNodes

        public EndpointPair<N> incidentNodes​(java.lang.Object edge)
        Description copied from interface: Network
        Returns the nodes which are the endpoints of edge in this network.
      • edgesConnecting

        public java.util.Set<E> edgesConnecting​(java.lang.Object nodeU,
                                                java.lang.Object nodeV)
        Description copied from interface: Network
        Returns the set of edges directly connecting nodeU to nodeV.

        In an undirected network, this is equal to edgesConnecting(nodeV, nodeU).

        The resulting set of edges will be parallel (i.e. have equal Network.incidentNodes(Object). If this network does not allow parallel edges, the resulting set will contain at most one edge.