• Home
• net.sourceforge.plantuml
• plantuml-epl
• 1.2025.0
• source code
• Graphs$TransposedNetwork.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.Graphs$TransposedNetwork.class Maven / Gradle / Ivy

????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30
nodeU
,567
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GH
edgeConnecting
:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/util/Optional;JGK
<(Lcom/google/common/graph/EndpointPair;)Ljava/util/Optional;MNO
edgeConnectingOrNull
8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;QNR
:(Lcom/google/common/graph/EndpointPair;)Ljava/lang/Object;TUV
hasEdgeConnecting
'(Ljava/lang/Object;Ljava/lang/Object;)ZXUY
)(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
bc

d
be
]
f
\g_A

*?
?`

?a
bcd
be\h
_[*?
+??`

?abcij
dbeik
f
i\l
_[*?
+??`

?abcij
dbeik
f
i\l
 _[*?
+??`

?abcij
dbeik
f
i\m
_[*?
+??`

?abcij
dbeik
f
i\m
&_[*?
+?!?`

?abcij
dbeik
f
i\n
#_[*?
+?$?`

?abcij
dbeik
f
i\n
)*_?*?
+?'M*?
,?+,?1?4?`

?
?a bcoj
pqd beor
psf
o\t
:;_p*?
,+?8?`

?a bc3j
/jd be3k
/kf	3/\u
:D_^*?
+?