Class UndirectedGraphConnections<N,V>

java.lang.Object
com.google.common.graph.UndirectedGraphConnections<N,V>
Type Parameters:
N - Node parameter type
V - Value parameter type
All Implemented Interfaces:
GraphConnections<N,V>

final class UndirectedGraphConnections<N,V> extends Object implements GraphConnections<N,V>
An implementation of GraphConnections for undirected graphs.
  • Field Details

    • adjacentNodeValues

      private final Map<N,V> adjacentNodeValues
  • Constructor Details

    • UndirectedGraphConnections

      private UndirectedGraphConnections(Map<N,V> adjacentNodeValues)
  • Method Details

    • of

      static <N, V> UndirectedGraphConnections<N,V> of(ElementOrder<N> incidentEdgeOrder)
    • ofImmutable

      static <N, V> UndirectedGraphConnections<N,V> ofImmutable(Map<N,V> adjacentNodeValues)
    • adjacentNodes

      public Set<N> adjacentNodes()
      Specified by:
      adjacentNodes in interface GraphConnections<N,V>
    • predecessors

      public Set<N> predecessors()
      Specified by:
      predecessors in interface GraphConnections<N,V>
    • successors

      public Set<N> successors()
      Specified by:
      successors in interface GraphConnections<N,V>
    • incidentEdgeIterator

      public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode)
      Description copied from interface: GraphConnections
      Returns an iterator over the incident edges.
      Specified by:
      incidentEdgeIterator in interface GraphConnections<N,V>
      Parameters:
      thisNode - The node that this all of the connections in this class are connected to.
    • value

      @CheckForNull public V value(N node)
      Description copied from interface: GraphConnections
      Returns the value associated with the edge connecting the origin node to node, or null if there is no such edge.
      Specified by:
      value in interface GraphConnections<N,V>
    • removePredecessor

      public void removePredecessor(N node)
      Description copied from interface: GraphConnections
      Remove node from the set of predecessors.
      Specified by:
      removePredecessor in interface GraphConnections<N,V>
    • removeSuccessor

      @CheckForNull public V removeSuccessor(N node)
      Description copied from interface: GraphConnections
      Remove node from the set of successors. Returns the value previously associated with the edge connecting the two nodes.
      Specified by:
      removeSuccessor in interface GraphConnections<N,V>
    • addPredecessor

      public void addPredecessor(N node, V value)
      Description copied from interface: GraphConnections
      Add node as a predecessor to the origin node. In the case of an undirected graph, it also becomes a successor. Associates value with the edge connecting the two nodes.
      Specified by:
      addPredecessor in interface GraphConnections<N,V>
    • addSuccessor

      @CheckForNull public V addSuccessor(N node, V value)
      Description copied from interface: GraphConnections
      Add node as a successor to the origin node. In the case of an undirected graph, it also becomes a predecessor. Associates value with the edge connecting the two nodes. Returns the value previously associated with the edge connecting the two nodes.
      Specified by:
      addSuccessor in interface GraphConnections<N,V>