com.google.common.graph.Graphs$TransposedNetwork.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 ? 0com/google/common/graph/Graphs$TransposedNetwork network !Lcom/google/common/graph/Network;
)com/google/common/graph/ForwardingNetwork ()V
delegate #()Lcom/google/common/graph/Network; com/google/common/graph/Network
successors #(Ljava/lang/Object;)Ljava/util/Set; predecessors outDegree (Ljava/lang/Object;)I inDegree " # outEdges % & inEdges ( ) *
incidentNodes :(Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
, - . / 0 $com/google/common/graph/EndpointPair nodeV ()Ljava/lang/Object;
, 2 3 0 nodeU
, 5 6 7 of m(Lcom/google/common/graph/Network;Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair; 9 : ; edgesConnecting 5(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Set;
= > ? @ A com/google/common/graph/Graphs transpose N(Lcom/google/common/graph/EndpointPair;)Lcom/google/common/graph/EndpointPair; C : D 7(Lcom/google/common/graph/EndpointPair;)Ljava/util/Set; F G H edgeConnecting :(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Optional; J G K <(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional; M N O edgeConnectingOrNull 8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object; Q N R :(Lcom/google/common/graph/EndpointPair;)Ljava/lang/Object; T U V hasEdgeConnecting '(Ljava/lang/Object;Ljava/lang/Object;)Z X U Y )(Lcom/google/common/graph/EndpointPair;)Z
Signature )Lcom/google/common/graph/Network; $(Lcom/google/common/graph/Network;)V Code LineNumberTable LocalVariableTable this 2Lcom/google/common/graph/Graphs$TransposedNetwork; LocalVariableTypeTable :Lcom/google/common/graph/Graphs$TransposedNetwork; MethodParameters ,(Lcom/google/common/graph/Network;)V +()Lcom/google/common/graph/Network; node Ljava/lang/Object; TN; (TN;)Ljava/util/Set; (TN;)I (TN;)Ljava/util/Set; edge endpointPair &Lcom/google/common/graph/EndpointPair; TE; +Lcom/google/common/graph/EndpointPair; 0(TE;)Lcom/google/common/graph/EndpointPair; (TN;TN;)Ljava/util/Set; endpoints A(Lcom/google/common/graph/EndpointPair;)Ljava/util/Set; !(TN;TN;)Ljava/util/Optional; F(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional; (TN;TN;)TE; RuntimeVisibleAnnotations Ljavax/annotation/CheckForNull; 0(Lcom/google/common/graph/EndpointPair;)TE; (TN;TN;)Z .(Lcom/google/common/graph/EndpointPair;)Z ((Ljava/lang/Object;)Ljava/lang/Iterable;
access$200 U(Lcom/google/common/graph/Graphs$TransposedNetwork;)Lcom/google/common/graph/Network; x0 ]Lcom/google/common/graph/ForwardingNetwork;
SourceFile Graphs.java InnerClasses TransposedNetwork \ ] ^ _ b
*? *+? ? ` ? ? ? a
b c
d
b e
] f \ g _ A *? ? ` ? a b c d b e \ h _ [ *?
+? ? ` ? a b c i j d b e i k f i \ l _ [ *?
+? ? ` ? a b c i j d b e i k f i \ l _ [ *?
+? ? ` ? a b c i j d b e i k f i \ m _ [ *?
+? ? ` ? a b c i j d b e i k f i \ m & _ [ *?
+? ! ? ` ? a b c i j d b e i k f i \ n # _ [ *?
+? $ ? ` ? a b c i j d b e i k f i \ n ) * _ ? *?
+? ' M*? ,? +,? 1? 4? `
? ? a b c o j p q d b e o r p s f o \ t : ; _ p *?
,+? 8 ? ` ? a b c 3 j / j d b e 3 k / k f 3 / \ u : D _ ^ *?
+?