Coverage Summary for Class: NetworkBuilder (com.google.common.graph)

Class Class, % Method, % Line, %
NetworkBuilder 0% (0/1) 0% (0/13) 0% (0/29)


1 /* 2  * Copyright (C) 2016 The Guava Authors 3  * 4  * Licensed under the Apache License, Version 2.0 (the "License"); 5  * you may not use this file except in compliance with the License. 6  * You may obtain a copy of the License at 7  * 8  * http://www.apache.org/licenses/LICENSE-2.0 9  * 10  * Unless required by applicable law or agreed to in writing, software 11  * distributed under the License is distributed on an "AS IS" BASIS, 12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13  * See the License for the specific language governing permissions and 14  * limitations under the License. 15  */ 16  17 package com.google.common.graph; 18  19 import static com.google.common.base.Preconditions.checkNotNull; 20 import static com.google.common.graph.Graphs.checkNonNegative; 21  22 import com.google.common.annotations.Beta; 23 import com.google.common.base.Optional; 24  25 /** 26  * A builder for constructing instances of {@link MutableNetwork} or {@link ImmutableNetwork} with 27  * user-defined properties. 28  * 29  * <p>A network built by this class will have the following properties by default: 30  * 31  * <ul> 32  * <li>does not allow parallel edges 33  * <li>does not allow self-loops 34  * <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the 35  * elements were added 36  * </ul> 37  * 38  * <p>Examples of use: 39  * 40  * <pre>{@code 41  * // Building a mutable network 42  * MutableNetwork<String, Integer> network = 43  * NetworkBuilder.directed().allowsParallelEdges(true).build(); 44  * flightNetwork.addEdge("LAX", "ATL", 3025); 45  * flightNetwork.addEdge("LAX", "ATL", 1598); 46  * flightNetwork.addEdge("ATL", "LAX", 2450); 47  * 48  * // Building a immutable network 49  * ImmutableNetwork<String, Integer> immutableNetwork = 50  * NetworkBuilder.directed() 51  * .allowsParallelEdges(true) 52  * .<String, Integer>immutable() 53  * .addEdge("LAX", "ATL", 3025) 54  * .addEdge("LAX", "ATL", 1598) 55  * .addEdge("ATL", "LAX", 2450) 56  * .build(); 57  * }</pre> 58  * 59  * @author James Sexton 60  * @author Joshua O'Madadhain 61  * @param <N> The most general node type this builder will support. This is normally {@code Object} 62  * unless it is constrained by using a method like {@link #nodeOrder}, or the builder is 63  * constructed based on an existing {@code Network} using {@link #from(Network)}. 64  * @param <E> The most general edge type this builder will support. This is normally {@code Object} 65  * unless it is constrained by using a method like {@link #edgeOrder}, or the builder is 66  * constructed based on an existing {@code Network} using {@link #from(Network)}. 67  * @since 20.0 68  */ 69 @Beta 70 @ElementTypesAreNonnullByDefault 71 public final class NetworkBuilder<N, E> extends AbstractGraphBuilder<N> { 72  boolean allowsParallelEdges = false; 73  ElementOrder<? super E> edgeOrder = ElementOrder.insertion(); 74  Optional<Integer> expectedEdgeCount = Optional.absent(); 75  76  /** Creates a new instance with the specified edge directionality. */ 77  private NetworkBuilder(boolean directed) { 78  super(directed); 79  } 80  81  /** Returns a {@link NetworkBuilder} for building directed networks. */ 82  public static NetworkBuilder<Object, Object> directed() { 83  return new NetworkBuilder<>(true); 84  } 85  86  /** Returns a {@link NetworkBuilder} for building undirected networks. */ 87  public static NetworkBuilder<Object, Object> undirected() { 88  return new NetworkBuilder<>(false); 89  } 90  91  /** 92  * Returns a {@link NetworkBuilder} initialized with all properties queryable from {@code 93  * network}. 94  * 95  * <p>The "queryable" properties are those that are exposed through the {@link Network} interface, 96  * such as {@link Network#isDirected()}. Other properties, such as {@link 97  * #expectedNodeCount(int)}, are not set in the new builder. 98  */ 99  public static <N, E> NetworkBuilder<N, E> from(Network<N, E> network) { 100  return new NetworkBuilder<N, E>(network.isDirected()) 101  .allowsParallelEdges(network.allowsParallelEdges()) 102  .allowsSelfLoops(network.allowsSelfLoops()) 103  .nodeOrder(network.nodeOrder()) 104  .edgeOrder(network.edgeOrder()); 105  } 106  107  /** 108  * Returns an {@link ImmutableNetwork.Builder} with the properties of this {@link NetworkBuilder}. 109  * 110  * <p>The returned builder can be used for populating an {@link ImmutableNetwork}. 111  * 112  * @since 28.0 113  */ 114  public <N1 extends N, E1 extends E> ImmutableNetwork.Builder<N1, E1> immutable() { 115  NetworkBuilder<N1, E1> castBuilder = cast(); 116  return new ImmutableNetwork.Builder<>(castBuilder); 117  } 118  119  /** 120  * Specifies whether the network will allow parallel edges. Attempting to add a parallel edge to a 121  * network that does not allow them will throw an {@link UnsupportedOperationException}. 122  * 123  * <p>The default value is {@code false}. 124  */ 125  public NetworkBuilder<N, E> allowsParallelEdges(boolean allowsParallelEdges) { 126  this.allowsParallelEdges = allowsParallelEdges; 127  return this; 128  } 129  130  /** 131  * Specifies whether the network will allow self-loops (edges that connect a node to itself). 132  * Attempting to add a self-loop to a network that does not allow them will throw an {@link 133  * UnsupportedOperationException}. 134  * 135  * <p>The default value is {@code false}. 136  */ 137  public NetworkBuilder<N, E> allowsSelfLoops(boolean allowsSelfLoops) { 138  this.allowsSelfLoops = allowsSelfLoops; 139  return this; 140  } 141  142  /** 143  * Specifies the expected number of nodes in the network. 144  * 145  * @throws IllegalArgumentException if {@code expectedNodeCount} is negative 146  */ 147  public NetworkBuilder<N, E> expectedNodeCount(int expectedNodeCount) { 148  this.expectedNodeCount = Optional.of(checkNonNegative(expectedNodeCount)); 149  return this; 150  } 151  152  /** 153  * Specifies the expected number of edges in the network. 154  * 155  * @throws IllegalArgumentException if {@code expectedEdgeCount} is negative 156  */ 157  public NetworkBuilder<N, E> expectedEdgeCount(int expectedEdgeCount) { 158  this.expectedEdgeCount = Optional.of(checkNonNegative(expectedEdgeCount)); 159  return this; 160  } 161  162  /** 163  * Specifies the order of iteration for the elements of {@link Network#nodes()}. 164  * 165  * <p>The default value is {@link ElementOrder#insertion() insertion order}. 166  */ 167  public <N1 extends N> NetworkBuilder<N1, E> nodeOrder(ElementOrder<N1> nodeOrder) { 168  NetworkBuilder<N1, E> newBuilder = cast(); 169  newBuilder.nodeOrder = checkNotNull(nodeOrder); 170  return newBuilder; 171  } 172  173  /** 174  * Specifies the order of iteration for the elements of {@link Network#edges()}. 175  * 176  * <p>The default value is {@link ElementOrder#insertion() insertion order}. 177  */ 178  public <E1 extends E> NetworkBuilder<N, E1> edgeOrder(ElementOrder<E1> edgeOrder) { 179  NetworkBuilder<N, E1> newBuilder = cast(); 180  newBuilder.edgeOrder = checkNotNull(edgeOrder); 181  return newBuilder; 182  } 183  184  /** Returns an empty {@link MutableNetwork} with the properties of this {@link NetworkBuilder}. */ 185  public <N1 extends N, E1 extends E> MutableNetwork<N1, E1> build() { 186  return new StandardMutableNetwork<>(this); 187  } 188  189  @SuppressWarnings("unchecked") 190  private <N1 extends N, E1 extends E> NetworkBuilder<N1, E1> cast() { 191  return (NetworkBuilder<N1, E1>) this; 192  } 193 }