Êþº¾4>1
234
Presence
InnerClasses
EXPECTED_DEGREE

I

ConstantValue
DEFAULT_NODE_COUNT

DEFAULT_EDGE_COUNT
INNER_LOAD_FACTOR

F?€
INNER_CAPACITY
NODE_NOT_IN_GRAPH
Ljava/lang/String;5
EDGE_NOT_IN_GRAPH6
REUSING_EDGE7
MULTIPLE_EDGES_CONNECTING8
PARALLEL_EDGES_NOT_ALLOWED9
SELF_LOOPS_NOT_ALLOWED:
NOT_AVAILABLE_ON_UNDIRECTED;
EDGE_ALREADY_EXISTS<
ENDPOINTS_MISMATCH=
<init>
()V
Code
LineNumberTable
LocalVariableTable
this
(Lcom/google/common/graph/GraphConstants;

SourceFile
GraphConstants.java
RuntimeVisibleAnnotations
9Lcom/google/common/graph/ElementTypesAreNonnullByDefault;
&com/google/common/graph/GraphConstants&'
java/lang/Object
/com/google/common/graph/GraphConstants$Presence
(Node %s is not an element of this graph.
(Edge %s is not an element of this graph.
rEdge %s already exists between the following nodes: %s, so it cannot be reused to connect the following nodes: %s.
uCannot call edgeConnecting() when parallel edges exist between %s and %s. Consider calling edgesConnecting() instead.
šNodes %s and %s are already connected by a different edge. To construct a graph that allows parallel edges, call allowsParallelEdges(true) on the Builder.
œCannot add self-loop edge on node %s, as self-loops are not allowed. To construct a graph that allows self-loops, call allowsSelfLoops(true) on the Builder.
ªCannot call source()/target() on a EndpointPair from an undirected graph. Consider calling adjacentNode(node) if you already have a node, or nodeU()/nodeV() if you don't.
$Edge %s already exists in the graph.
AMismatch: unordered endpoints cannot be used with directed graphs0

	

	

	
	
	

	
	
	
	
	
	 
	!"
	#$
	%
&'
(/

*·±)
*
+,-./
0


@