com.google.common.graph.StandardMutableNetwork.class Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml Show documentation
Show all versions of plantuml Show documentation
PlantUML is a component that allows to quickly write :
* sequence diagram,
* use case diagram,
* class diagram,
* activity diagram,
* component diagram,
* state diagram
* object diagram
???? 4 ? &com/google/common/graph/GraphConstants
'com/google/common/graph/StandardNetwork +(Lcom/google/common/graph/NetworkBuilder;)V
node
$com/google/common/base/Preconditions checkNotNull 8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
.com/google/common/graph/StandardMutableNetwork containsNode (Ljava/lang/Object;)Z
addNodeInternal @(Ljava/lang/Object;)Lcom/google/common/graph/NetworkConnections;
newConnections .()Lcom/google/common/graph/NetworkConnections; ! " nodeConnections *Lcom/google/common/graph/MapIteratorCache;
$ % & ' (com/google/common/graph/MapIteratorCache put
) * +
checkState (Z)V - nodeU / nodeV 1 edge
3 4 containsEdge
6 7 8
incidentNodes :(Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
: ; < = > $com/google/common/graph/EndpointPair of m(Lcom/google/common/graph/Network;Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
: @ A equals C rEdge %s already exists between the following nodes: %s, so it cannot be reused to connect the following nodes: %s.
E F G
checkArgument L(ZLjava/lang/String;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)V
$ I J K get &(Ljava/lang/Object;)Ljava/lang/Object; M *com/google/common/graph/NetworkConnections
O P Q allowsParallelEdges ()Z L S T U
successors ()Ljava/util/Set; W X Y Z
java/util/Set contains \ ?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.
^ F _ :(ZLjava/lang/String;Ljava/lang/Object;Ljava/lang/Object;)V
a @ b java/lang/Object
d e Q allowsSelfLoops g ?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.
i F j ((ZLjava/lang/String;Ljava/lang/Object;)V L l m n
addOutEdge '(Ljava/lang/Object;Ljava/lang/Object;)V L p q r addInEdge ((Ljava/lang/Object;Ljava/lang/Object;Z)V t u " edgeToReferenceNode
w x y validateEndpoints )(Lcom/google/common/graph/EndpointPair;)V
: { - | ()Ljava/lang/Object;
: ~ / |
? ? ? addEdge 9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z L ? ? U
incidentEdges
? ? ? ? ? 'com/google/common/collect/ImmutableList copyOf A(Ljava/util/Collection;)Lcom/google/common/collect/ImmutableList;
? ? ? ? iterator 2()Lcom/google/common/collect/UnmodifiableIterator; ? ? ? ? Q java/util/Iterator hasNext ? ? ? | next
? ?
removeEdge
$ ? ? K remove
? ? ? ? K java/util/Objects requireNonNull L ? ? K adjacentNode L ? ? K
removeOutEdge L ? ? ? removeInEdge '(Ljava/lang/Object;Z)Ljava/lang/Object;
? ? Q
isDirected
? ? ? = ? 7com/google/common/graph/DirectedMultiNetworkConnections ;()Lcom/google/common/graph/DirectedMultiNetworkConnections;
? ? ? = ? 2com/google/common/graph/DirectedNetworkConnections 6()Lcom/google/common/graph/DirectedNetworkConnections;
? ? ? = ? 9com/google/common/graph/UndirectedMultiNetworkConnections =()Lcom/google/common/graph/UndirectedMultiNetworkConnections;
? ? ? = ? 4com/google/common/graph/UndirectedNetworkConnections 8()Lcom/google/common/graph/UndirectedNetworkConnections; ? &com/google/common/graph/MutableNetwork Code LineNumberTable LocalVariableTable this 0Lcom/google/common/graph/StandardMutableNetwork; builder (Lcom/google/common/graph/NetworkBuilder; LocalVariableTypeTable 8Lcom/google/common/graph/StandardMutableNetwork; 2Lcom/google/common/graph/NetworkBuilder<-TN;-TE;>; MethodParameters Signature 5(Lcom/google/common/graph/NetworkBuilder<-TN;-TE;>;)V addNode Ljava/lang/Object; TN;
StackMapTable (TN;)Z RuntimeInvisibleAnnotations 8Lcom/google/errorprone/annotations/CanIgnoreReturnValue; connections ,Lcom/google/common/graph/NetworkConnections; 4Lcom/google/common/graph/NetworkConnections; 9(TN;)Lcom/google/common/graph/NetworkConnections; existingIncidentNodes &Lcom/google/common/graph/EndpointPair; newIncidentNodes connectionsU
isSelfLoop Z connectionsV +Lcom/google/common/graph/EndpointPair; TE; (TN;TN;TE;)Z ;(Lcom/google/common/graph/EndpointPair;Ljava/lang/Object;)Z endpoints 1(Lcom/google/common/graph/EndpointPair;TE;)Z
removeNode (TE;)Z 6()Lcom/google/common/graph/NetworkConnections; ?Lcom/google/common/graph/StandardNetwork;Lcom/google/common/graph/MutableNetwork;
SourceFile StandardMutableNetwork.java RuntimeVisibleAnnotations 9Lcom/google/common/graph/ElementTypesAreNonnullByDefault; 0 ? ? Z *+? ? ?
1 2 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? + ? W*+? ? ?*+? W? ? 7 9 : = > ? ? ?
? ? ? ?
? ? ?
? ? ? ? ? ? *? M*? +,? #? ? ? (,? ? H I J ? ? ?
? ? ? ? ? ?
? ? ? ?
? L@ ?
? ? ? ? ? ? ? 2 ?+,? W,.? W-0? W*-? 2? %*-? 5:*+,? 9:? ?B-? D?*? +? H? L:*? N? $? ? R ,? V ? ? [+,? ]+,? `6*? c? ? ? f+? h?
*+? :-,? k *? ,? H? L:?
*,? :-+? o *? s-+? #W? ? n P Q R T U $ V , W 0 X : W = ] ? _ L ` S a Z b q a t g { h ? i ? l ? m ? o ? p ? q ? r ? t ? u ? v ? \ $ ? ? , ? ? ? ? ? ? - ? ? / ? ? 1 ? L ? ? ? { \ ? ? ? # ? ? ? R $ ? ? , ? ? ? ? ? ? - ? ? / ? ? 1 ? L ? ? ? ? # ? ? ?
?? ( L@? @ ? ! L ?
- / 1 ? ? ? ? ? ? ? { *+? v*+? z+? },? ? ?
| } ? ? ? ? ? 1 ? ? ? ? ? ? 1 ? ? ? 1 ? ? ? ? ? ? ? L+ ? W*? +? H? LM,? ?,? ? ? ?? ?N-? ? ? -? ? :*? ?W???*? +? ?W? ? & ? ? ? ? ? 7 ? > ? A ? J ? ? * 7 1 ? L ? ? L
? 9 ? ? ? * 7 1 ? L ? ? L
? 9 ? ? ? ? L? ?? ?
? ? ? ? ? ? ? v+0? W*? s+? HM,? ?*? ,? H? L? ?? LN-+? ? :*? ? H? L? ?? L:-+? ? W+*? c? ,? `? ? ? ? W*? s+? ?W? ? . ? ? ? ? ? ( ? 1 ? E ? M ? k ? t ? ? > v ? ? v 1 ? f - ? ( N ? ? 1 E / ? E 1 ? ? ? > v ? ? v 1 ? f - ? ( N ? ? 1 E / ? E 1 ? ? ? G ? a? M a a L a L L a? a a L a L L a ? 1 ? ? ? ? ? ? +*? ?? *? N? ? ?? ? ?? *? N? ? ?? ? ?? ? " ? ? ? ? ? ! ? ' ? * ? ? + ? ? ? + ? ? ? B L ? ? ? ? ? ? ? ? © 2015 - 2025 Weber Informatics LLC | Privacy Policy