• Home
• net.sourceforge.plantuml
• plantuml
• 1.2024.6
• source code
• GraphConstants.class

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

com.google.common.graph.GraphConstants.class Maven / Gradle / Ivy

????4G7
89:
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;;
EDGE_NOT_IN_GRAPH<
NODE_REMOVED_FROM_GRAPH=
NODE_PAIR_REMOVED_FROM_GRAPH>
EDGE_REMOVED_FROM_GRAPH?
REUSING_EDGE@
MULTIPLE_EDGES_CONNECTINGA
PARALLEL_EDGES_NOT_ALLOWEDB
SELF_LOOPS_NOT_ALLOWEDC
NOT_AVAILABLE_ON_UNDIRECTEDD
EDGE_ALREADY_EXISTSE
ENDPOINTS_MISMATCHF

()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.
ENode %s that was used to generate this set is no longer in the graph.
RNode %s or node %s that were used to generate this set are no longer in the graph.
EEdge %s that was used to generate this set is no longer in the 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.
PMismatch: endpoints' ordering is not compatible with directionality of the graph0

	

	

	
	
	

	
	
	
	
	
	 
	!"
	#$
	%&
	'(
	)*
	+
,-
./

*??/
0
12345
6


@