Class ImmutableNetwork<N,​E>

    • Field Detail

      • nodeConnections

        protected final com.google.common.graph.MapIteratorCache<N,​com.google.common.graph.NetworkConnections<N,​E>> nodeConnections
      • edgeToReferenceNode

        protected final com.google.common.graph.MapIteratorCache<E,​N> edgeToReferenceNode
    • Method Detail

      • nodes

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

        public 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 IllegalArgumentException.
      • 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 IllegalArgumentException.
      • incidentNodes

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

        public Set<E> edgesConnecting​(N nodeU,
                                      N nodeV)
        Description copied from interface: Network
        Returns the set of edges that each directly connect 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 (equivalent to edgeConnecting(nodeU, nodeV).asSet()).

        Specified by:
        edgesConnecting in interface Network<N,​E>
        Overrides:
        edgesConnecting in class AbstractNetwork<N,​E>
      • inEdges

        public Set<E> inEdges​(N 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 Set<E> outEdges​(N 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).

      • predecessors

        public Set<N> predecessors​(N 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 Set<N> successors​(N 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).

      • checkedConnections

        protected final com.google.common.graph.NetworkConnections<N,​E> checkedConnections​(N node)
      • checkedReferenceNode

        protected final N checkedReferenceNode​(E edge)
      • containsNode

        protected final boolean containsNode​(@Nullable N node)
      • containsEdge

        protected final boolean containsEdge​(@Nullable E edge)