| ImmutableNetwork.Builder<N,E> | ImmutableNetwork.Builder. addEdge(EndpointPair<N> endpoints,
       E edge) | Adds edgeconnectingendpoints. | 
| boolean | MutableNetwork. addEdge(EndpointPair<N> endpoints,
       E edge) | Adds edgeconnectingendpoints. | 
| java.util.Optional<E> | AbstractNetwork. edgeConnecting(EndpointPair<N> endpoints) |  | 
| java.util.Optional<E> | Network. edgeConnecting(EndpointPair<N> endpoints) | Returns the single edge that directly connects endpoints(in the order, if any,
 specified byendpoints), if one is present, orOptional.empty()if no such edge
 exists. | 
| E | AbstractNetwork. edgeConnectingOrNull(EndpointPair<N> endpoints) |  | 
| E | Network. edgeConnectingOrNull(EndpointPair<N> endpoints) | Returns the single edge that directly connects endpoints(in the order, if any,
 specified byendpoints), if one is present, ornullif no such edge exists. | 
| java.util.Set<E> | AbstractNetwork. edgesConnecting(EndpointPair<N> endpoints) |  | 
| java.util.Set<E> | Network. edgesConnecting(EndpointPair<N> endpoints) | Returns the set of edges that each directly connect endpoints(in the order, if any,
 specified byendpoints). | 
| java.util.Optional<V> | AbstractValueGraph. edgeValue(EndpointPair<N> endpoints) |  | 
| java.util.Optional<V> | ValueGraph. edgeValue(EndpointPair<N> endpoints) | Returns the value of the edge that connects endpoints(in the order, if any, specified
 byendpoints), if one is present; otherwise, returnsOptional.empty(). | 
| V | ValueGraph. edgeValueOrDefault(EndpointPair<N> endpoints,
                  V defaultValue) | Returns the value of the edge that connects endpoints(in the order, if any, specified
 byendpoints), if one is present; otherwise, returnsdefaultValue. | 
| boolean | AbstractNetwork. hasEdgeConnecting(EndpointPair<N> endpoints) |  | 
| boolean | Graph. hasEdgeConnecting(EndpointPair<N> endpoints) | Returns true if there is an edge that directly connects endpoints(in the order, if
 any, specified byendpoints). | 
| boolean | Network. hasEdgeConnecting(EndpointPair<N> endpoints) | Returns true if there is an edge that directly connects endpoints(in the order, if
 any, specified byendpoints). | 
| boolean | ValueGraph. hasEdgeConnecting(EndpointPair<N> endpoints) | Returns true if there is an edge that directly connects endpoints(in the order, if
 any, specified byendpoints). | 
| protected boolean | AbstractNetwork. isOrderingCompatible(EndpointPair<?> endpoints) |  | 
| ImmutableGraph.Builder<N> | ImmutableGraph.Builder. putEdge(EndpointPair<N> endpoints) | Adds an edge connecting endpoints(in the order, if any, specified by
 endpoints) if one is not already present. | 
| boolean | MutableGraph. putEdge(EndpointPair<N> endpoints) | Adds an edge connecting endpoints(in the order, if any, specified by
 endpoints) if one is not already present. | 
| ImmutableValueGraph.Builder<N,V> | ImmutableValueGraph.Builder. putEdgeValue(EndpointPair<N> endpoints,
            V value) | Adds an edge connecting endpointsif one is not already present, and sets a value for
 that edge tovalue(overwriting the existing value, if any). | 
| V | MutableValueGraph. putEdgeValue(EndpointPair<N> endpoints,
            V value) | Adds an edge connecting endpointsif one is not already present, and sets a value for
 that edge tovalue(overwriting the existing value, if any). | 
| boolean | MutableGraph. removeEdge(EndpointPair<N> endpoints) | Removes the edge connecting endpoints, if it is present. | 
| V | MutableValueGraph. removeEdge(EndpointPair<N> endpoints) | Removes the edge connecting endpoints, if it is present. | 
| protected void | AbstractNetwork. validateEndpoints(EndpointPair<?> endpoints) | Throws an IllegalArgumentException if the ordering of endpointsis not compatible with
 the directionality of this graph. |