java.lang.Object
- com.google.common.graph.AbstractNetwork<N,E>
- - com.google.common.graph.ConfigurableNetwork<N,E>

Type Parameters:

N - Node parameter type

E - Edge parameter type

All Implemented Interfaces:

Network<N,E>, PredecessorsFunction<N>, SuccessorsFunction<N>

Direct Known Subclasses:

ConfigurableMutableNetwork, ImmutableNetwork
```
class ConfigurableNetwork<N,E>
extends AbstractNetwork<N,E>
```
Configurable implementation of Network that supports the options supplied by NetworkBuilder.
This class maintains a map of nodes to NetworkConnections. This class also maintains a map of edges to reference nodes. The reference node is defined to be the edge's source node on directed graphs, and an arbitrary endpoint of the edge on undirected graphs.
Collection-returning accessors return unmodifiable views: the view returned will reflect changes to the graph (if the graph is mutable) but may not be modified by the user.
The time complexity of all collection-returning accessors is O(1), since views are returned.

Field Summary

Fields
Modifier and Type	Field	Description
`private boolean`	`allowsParallelEdges`
`private boolean`	`allowsSelfLoops`
`private ElementOrder<E>`	`edgeOrder`
`protected MapIteratorCache<E,N>`	`edgeToReferenceNode`
`private boolean`	`isDirected`
`protected MapIteratorCache<N,NetworkConnections<N,E>>`	`nodeConnections`
`private ElementOrder<N>`	`nodeOrder`

Constructor Summary

Constructors
Constructor	Description
`ConfigurableNetwork(NetworkBuilder<? super N,? super E> builder)`	Constructs a graph with the properties specified in `builder`.
`ConfigurableNetwork(NetworkBuilder<? super N,? super E> builder, java.util.Map<N,NetworkConnections<N,E>> nodeConnections, java.util.Map<E,N> edgeToReferenceNode)`	Constructs a graph with the properties specified in `builder`, initialized with the given node and edge maps.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`java.util.Set<N>`	`adjacentNodes(N 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).
`protected NetworkConnections<N,E>`	`checkedConnections(N node)`
`protected N`	`checkedReferenceNode(E edge)`
`protected boolean`	`containsEdge(E edge)`
`protected boolean`	`containsNode(N node)`
`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(N nodeU, N nodeV)`	Returns the set of edges that each directly connect `nodeU` to `nodeV`.
`java.util.Set<E>`	`incidentEdges(N node)`	Returns the edges whose `incident nodes` in this network include `node`.
`EndpointPair<N>`	`incidentNodes(E edge)`	Returns the nodes which are the endpoints of `edge` in this network.
`java.util.Set<E>`	`inEdges(N 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(N 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(N 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(N 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 com.google.common.graph.AbstractNetwork
adjacentEdges, asGraph, degree, edgeConnecting, edgeConnecting, edgeConnectingOrNull, edgeConnectingOrNull, edgesConnecting, equals, hasEdgeConnecting, hasEdgeConnecting, hashCode, inDegree, isOrderingCompatible, outDegree, toString, validateEndpoints

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

- Field Detail
  - isDirected
```
private final boolean isDirected
```
  - allowsParallelEdges
```
private final boolean allowsParallelEdges
```
  - allowsSelfLoops
```
private final boolean allowsSelfLoops
```
  - nodeOrder
```
private final ElementOrder<N> nodeOrder
```
  - edgeOrder
```
private final ElementOrder<E> edgeOrder
```
  - nodeConnections
```
protected final MapIteratorCache<N,NetworkConnections<N,E>> nodeConnections
```
  - edgeToReferenceNode
```
protected final MapIteratorCache<E,N> edgeToReferenceNode
```
- Constructor Detail
  - ConfigurableNetwork
```
ConfigurableNetwork(NetworkBuilder<? super N,? super E> builder)
```
    Constructs a graph with the properties specified in builder.
  - ConfigurableNetwork
```
ConfigurableNetwork(NetworkBuilder<? super N,? super E> builder,
                    java.util.Map<N,NetworkConnections<N,E>> nodeConnections,
                    java.util.Map<E,N> edgeToReferenceNode)
```
    Constructs a graph with the properties specified in builder, initialized with the given node and edge maps.
- 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 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.
  - nodeOrder
```
public ElementOrder<N> nodeOrder()
```
    Description copied from interface: Network
    
    Returns the order of iteration for the elements of Network.nodes().
  - edgeOrder
```
public ElementOrder<E> edgeOrder()
```
    Description copied from interface: Network
    
    Returns the order of iteration for the elements of Network.edges().
  - incidentEdges
```
public java.util.Set<E> incidentEdges(N node)
```
    Description copied from interface: Network
    
    Returns the edges whose incident nodes in this network include node.
    This is equal to the union of Network.inEdges(Object) and Network.outEdges(Object).
  - incidentNodes
```
public EndpointPair<N> incidentNodes(E edge)
```
    Description copied from interface: Network
    
    Returns the nodes which are the endpoints of edge in this network.
  - adjacentNodes
```
public java.util.Set<N> adjacentNodes(N node)
```
    Description copied from interface: Network
    
    Returns the nodes which have an incident edge in common with node in this network.
    This is equal to the union of Network.predecessors(Object) and Network.successors(Object).
  - edgesConnecting
```
public java.util.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 java.util.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 java.util.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 java.util.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 java.util.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 NetworkConnections<N,E> checkedConnections(N node)
```
  - checkedReferenceNode
```
protected final N checkedReferenceNode(E edge)
```
  - containsNode
```
protected final boolean containsNode(N node)
```
  - containsEdge
```
protected final boolean containsEdge(E edge)
```

Class ConfigurableNetwork<N,​E>

Field Summary

Constructor Summary

Method Summary

Methods inherited from class com.google.common.graph.AbstractNetwork

Methods inherited from class java.lang.Object

Field Detail

isDirected

allowsParallelEdges

allowsSelfLoops

nodeOrder

edgeOrder

nodeConnections

edgeToReferenceNode

Constructor Detail

ConfigurableNetwork

ConfigurableNetwork

Method Detail

nodes

edges

isDirected

allowsParallelEdges

allowsSelfLoops

nodeOrder

edgeOrder

incidentEdges

incidentNodes

adjacentNodes

edgesConnecting

inEdges

outEdges

predecessors

successors

checkedConnections

checkedReferenceNode

containsNode

containsEdge

Class ConfigurableNetwork<N,E>