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

????4
??
^?????????
????{?{?
]?????????
]?z??	?	?z???
]?
??
??
??
??
]?
??
?



??
?




?
?



	








?


+

+

?

/

/


2

2

R

R

R

R

9?
?

?
?
 ???
!

"
#

"
$

"
%?
 ??
?

&

'
(?
)

*
+

*
,

*
-?
 ???
.?
/
R
0?
1
2
R
3
R
4
?
???

*
5
6

	
7

	
8
9
:
;
NodeVisitState
InnerClasses
TransposedNetwork
TransposedValueGraph
TransposedGraph

()V
Code
LineNumberTable
LocalVariableTable
this
 Lcom/google/common/graph/Graphs;
hasCycle
"(Lcom/google/common/graph/Graph;)Z
node
Ljava/lang/Object;
graph
Lcom/google/common/graph/Graph;
numEdges

I
visitedNodes
Ljava/util/Map;
LocalVariableTypeTable
TN;
$Lcom/google/common/graph/Graph;
RLjava/util/Map;

StackMapTable
<
=
MethodParameters
	Signature
=(Lcom/google/common/graph/Graph;)Z
$(Lcom/google/common/graph/Network;)Z
network
!Lcom/google/common/graph/Network;
%Lcom/google/common/graph/Network<**>;
((Lcom/google/common/graph/Network<**>;)Z
subgraphHasCycle
U(Lcom/google/common/graph/Graph;Ljava/util/Map;Ljava/lang/Object;Ljava/lang/Object;)Z
nextNode
previousNode
state
/Lcom/google/common/graph/Graphs$NodeVisitState;
?(Lcom/google/common/graph/Graph;Ljava/util/Map;TN;TN;)Z
"RuntimeVisibleParameterAnnotations
Ljavax/annotation/CheckForNull;
canTraverseWithoutReusingEdge
F(Lcom/google/common/graph/Graph;Ljava/lang/Object;Ljava/lang/Object;)Z
"Lcom/google/common/graph/Graph<*>;
I(Lcom/google/common/graph/Graph<*>;Ljava/lang/Object;Ljava/lang/Object;)Z
transitiveClosure
I(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/ImmutableGraph;

reachableNode
nodeV
nodeU
reachableNodes
Ljava/util/Set;

pairwiseMatch
?
Builder
0Lcom/google/common/graph/ImmutableGraph$Builder;
Ljava/util/Set;
5Lcom/google/common/graph/ImmutableGraph$Builder;
@
A
B
i(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/ImmutableGraph;
[(Lcom/google/common/graph/Graph;Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;
l(Lcom/google/common/graph/Graph;TN;)Lcom/google/common/collect/ImmutableSet;
	transpose
@(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/Graph;
`(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/Graph;
J(Lcom/google/common/graph/ValueGraph;)Lcom/google/common/graph/ValueGraph;
$Lcom/google/common/graph/ValueGraph;
,Lcom/google/common/graph/ValueGraph;
?(Lcom/google/common/graph/ValueGraph;)Lcom/google/common/graph/ValueGraph;
D(Lcom/google/common/graph/Network;)Lcom/google/common/graph/Network;
)Lcom/google/common/graph/Network;
~(Lcom/google/common/graph/Network;)Lcom/google/common/graph/Network;
N(Lcom/google/common/graph/EndpointPair;)Lcom/google/common/graph/EndpointPair;
	endpoints
&Lcom/google/common/graph/EndpointPair;
+Lcom/google/common/graph/EndpointPair;
n(Lcom/google/common/graph/EndpointPair;)Lcom/google/common/graph/EndpointPair;
inducedSubgraph
[(Lcom/google/common/graph/Graph;Ljava/lang/Iterable;)Lcom/google/common/graph/MutableGraph;

successorNode
nodes
Ljava/lang/Iterable;
subgraph
&Lcom/google/common/graph/MutableGraph;
Ljava/lang/Iterable<+TN;>;
+Lcom/google/common/graph/MutableGraph;
C
?(Lcom/google/common/graph/Graph;Ljava/lang/Iterable<+TN;>;)Lcom/google/common/graph/MutableGraph;
e(Lcom/google/common/graph/ValueGraph;Ljava/lang/Iterable;)Lcom/google/common/graph/MutableValueGraph;
+Lcom/google/common/graph/MutableValueGraph;
3Lcom/google/common/graph/MutableValueGraph;
D
?(Lcom/google/common/graph/ValueGraph;Ljava/lang/Iterable<+TN;>;)Lcom/google/common/graph/MutableValueGraph;
_(Lcom/google/common/graph/Network;Ljava/lang/Iterable;)Lcom/google/common/graph/MutableNetwork;
edge
(Lcom/google/common/graph/MutableNetwork;
TE;
0Lcom/google/common/graph/MutableNetwork;
E
?(Lcom/google/common/graph/Network;Ljava/lang/Iterable<+TN;>;)Lcom/google/common/graph/MutableNetwork;
copyOf
G(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/MutableGraph;
copy
g(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/MutableGraph;
Q(Lcom/google/common/graph/ValueGraph;)Lcom/google/common/graph/MutableValueGraph;
?(Lcom/google/common/graph/ValueGraph;)Lcom/google/common/graph/MutableValueGraph;
K(Lcom/google/common/graph/Network;)Lcom/google/common/graph/MutableNetwork;
endpointPair
?(Lcom/google/common/graph/Network;)Lcom/google/common/graph/MutableNetwork;
checkNonNegative
(I)I
value
RuntimeInvisibleAnnotations
8Lcom/google/errorprone/annotations/CanIgnoreReturnValue;
(J)J

J

checkPositive

SourceFile
Graphs.java
RuntimeVisibleAnnotations
9Lcom/google/common/graph/ElementTypesAreNonnullByDefault;
$Lcom/google/common/annotations/Beta;
&com/google/common/graph/GraphConstantsde
F
G
H
I
J
K?
G
L
M
N
O
P
Q
K
R
S??
T
U
K
V
Wkl
X
Y
-com/google/common/graph/Graphs$NodeVisitState
Z?
[?
\
]
^
_??
`
a
b
c
d
e
f
g
h
i??
j
O
k
l
m
java/util/HashSet
n
o
p
q
r
s
t
u
v
w
(Node %s is not an element of this graph.
x
y
z
{
|
}
~
?
?
.com/google/common/graph/Graphs$TransposedGraph
?
?d
?
?
3com/google/common/graph/Graphs$TransposedValueGraph
?
?d
?
0com/google/common/graph/Graphs$TransposedNetwork
?
?d
?
?
K
?
S
?
S
?
?
java/util/Collection
?
?
v
?
?
o
l
b
?
d
?
?
?
v
?
?
?
?
?
Y
?
?
?
d
?
?
?
v
?
?
_
?
?
?
Y
?
?
$com/google/common/graph/EndpointPair?
S?
S
?
?
!Not true that %s is non-negative.
y
?
y
?
Not true that %s is positive.
com/google/common/graph/Graphs
+com/google/common/graph/GraphsBridgeMethods

java/util/Map
java/util/Iterator
?
.com/google/common/graph/ImmutableGraph$Builder
java/lang/Object

java/util/Set
com/google/common/graph/Graph
$com/google/common/graph/MutableGraph
)com/google/common/graph/MutableValueGraph
&com/google/common/graph/MutableNetwork
edges
()Ljava/util/Set;
size
()I

isDirected
()Z
com/google/common/collect/Maps
newHashMapWithExpectedSize
(I)Ljava/util/HashMap;
iterator
()Ljava/util/Iterator;
hasNext
next
()Ljava/lang/Object;
com/google/common/graph/Network
allowsParallelEdges
asGraph
!()Lcom/google/common/graph/Graph;
get
&(Ljava/lang/Object;)Ljava/lang/Object;
COMPLETE
PENDING
put
8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;

successors
#(Ljava/lang/Object;)Ljava/util/Set;
com/google/common/base/Objects
equal
'(Ljava/lang/Object;Ljava/lang/Object;)Z
$com/google/common/graph/GraphBuilder
from
G(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/GraphBuilder;
allowsSelfLoops
)(Z)Lcom/google/common/graph/GraphBuilder;
	immutable
2()Lcom/google/common/graph/ImmutableGraph$Builder;
&com/google/common/collect/ImmutableSet
2()Lcom/google/common/collect/UnmodifiableIterator;
putEdge
V(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/graph/ImmutableGraph$Builder;
contains
(Ljava/lang/Object;)Z
addAll
(Ljava/util/Collection;)Z
#com/google/common/collect/Iterables
limit
+(Ljava/lang/Iterable;I)Ljava/lang/Iterable;
java/lang/Iterable
build
*()Lcom/google/common/graph/ImmutableGraph;
$com/google/common/base/Preconditions

checkArgument
((ZLjava/lang/String;Ljava/lang/Object;)V
!com/google/common/graph/Traverser
forGraph
Q(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;
breadthFirst
((Ljava/lang/Object;)Ljava/lang/Iterable;
>(Ljava/lang/Iterable;)Lcom/google/common/collect/ImmutableSet;

access$000
Q(Lcom/google/common/graph/Graphs$TransposedGraph;)Lcom/google/common/graph/Graph;
"(Lcom/google/common/graph/Graph;)V
"com/google/common/graph/ValueGraph

access$100
[(Lcom/google/common/graph/Graphs$TransposedValueGraph;)Lcom/google/common/graph/ValueGraph;
'(Lcom/google/common/graph/ValueGraph;)V

access$200
U(Lcom/google/common/graph/Graphs$TransposedNetwork;)Lcom/google/common/graph/Network;
$(Lcom/google/common/graph/Network;)V
	isOrdered
target
source
ordered
L(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
expectedNodeCount
)(I)Lcom/google/common/graph/GraphBuilder;
(()Lcom/google/common/graph/MutableGraph;
addNode
)com/google/common/graph/ValueGraphBuilder
Q(Lcom/google/common/graph/ValueGraph;)Lcom/google/common/graph/ValueGraphBuilder;
.(I)Lcom/google/common/graph/ValueGraphBuilder;
-()Lcom/google/common/graph/MutableValueGraph;
edgeValueOrDefault
J(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
java/util/Objects
requireNonNull
putEdgeValue
&com/google/common/graph/NetworkBuilder
K(Lcom/google/common/graph/Network;)Lcom/google/common/graph/NetworkBuilder;
+(I)Lcom/google/common/graph/NetworkBuilder;
*()Lcom/google/common/graph/MutableNetwork;
outEdges

incidentNodes
:(Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
adjacentNode
addEdge
9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z
expectedEdgeCount
(ZLjava/lang/String;I)V
(ZLjava/lang/String;J)V
&com/google/common/graph/ImmutableGraph1]^de
f/

*??g
1h
ij	klf
j*?
?
<??*?
?*?
?
??*?
?
?M*?
?
N-?	
?-?

:*,
???????g2=>?A*B,E-F;GXHcIeKhLh*X
mnjop^qr
;/stu X
mvjow;/sxy?
?z{?|
o}~	kf?
<*?
?,*?

?#*?
?
*?
?
?
??*?
??gY
Z[0\2^h
<??u
<??y
2|
?}?
??f
Rs+,??:??????+,??W*,??
:?	
?&?

:*-??*+,??????+,??W?g6
klmop s+tLu[vawcyfzq{h>L?nsopsst
smns?ng??u4L?vsowssx
smvs?vy?	?{)?|osm?}??

?
??fw*?
?,+????g???h op?n
?nu
o?y
|
o??}??
?	??f??*???L*?
?M*?
?
M,?	
?5,?

N*-??:?	
??

:+-?W????ȧ??Y? M*?
?
N-?	
?|-?

:,?!?f*?:,?"W6?
:?	
???

:?
?#?$
:		?	
?	?

:
+
?W????????+?%?gV?
???1?N?V?Y?_?g???????????????????????hf
N?n1(mn?	?n
?0?n?[???O?r?nmng?s??op???
u\	N?v1(mv?	?v
?0?v?[???nmvg?s??ow???
yc?!?{??{????{?8???{??
{?#?{?????{?|
o}?	??fr*?
+?!&+?'*?(+?)?*?g
??hopmn
uowmv
|	om}?	??fy
#*?
?*?*?+?*?+?,??+Y*?-?g?	????h
#opu
#owy|
o}?	??fy
#*?.
?*?*?/?*?/?0??/Y*?1?g?	????h
#o?u
#o?y|
o}?	??fy
#*?
?*?*?2?*?2?3??2Y*?4?g?	????h
#??u
#??y|
?}???fb
*?5?*?6*?7?8?*?g


h
??u
??y
|
?}?	??f
??+?9?*?+?9?:
?;?
?
N-?	
?N-?

:*??
:?	
?*?

:,?>
?!?,??W??ҧ??,?g6

?
?
?%
?=
?F
?I
?f
??
??
??
??
??
?h>=	mn??nf@mn?op???
%???u>=	mv??vf@mv?ow???
%???y)	F???{??{??{-??|	o?}?	??f
??+?9?*?@+?9?:
?A?B?
*?@?BM+?$
N-?	
?-?

:,?CW???,?D
?
N-?	
?\-?

:*?E?
:?	
?8?

:,?D
?!?,*
?F?G?HW??ħ??,?g>%=	F
If?
??????h>=	mn?)?nfNmn?o????
%???u>=	mv?)?vfNmv?o????
%???y)	F???{??{??{;??|	o?}?	??f
??+?9?*?I+?9?:
?J?K?
*?I?KM+?$
N-?	
?-?

:,?LW???,?M
?
N-?	
?_-?

:*?N?
:?	
?;?

:*?O?P:,?M
?!?,?QW??????,?g:$%&%'=(F)I*f+?,?-?.?0?1?2hH=	mn??n?,?nfQmn??????
%???uH=	mv??v?,??fQmv??????
%???y)	F???{??{??{>??|	??}?	??f
!p*?*?
?
?;?h*2mn\??popZ??
u*2mv\??powZ??
y?"?{??{?$|
o}?	??f
G?*?@*?U
?
?A?BL*?U
?
M,?	
?,?

N+-?CW???*?V
?
M,?	
?1,?

?RN+-?S-?T*-?S-?T
?F?G?HW???+?g6
C
DE2F:G=H\J^KbLgMwJ}N?Oh*2mn\!???o?l??
u*2mv\!???o?l??
y?"?{??{?6|
o}?	??f
`?*?I*?W
?
?J*?
?
?X?KL*?W
?
M,?	
?,?

N+-?LW???*?
?
M,?	
?(,?

N*-?O:+?S?T-?QW???+?g6
T
UVW X$Y@ZH[K\g]p^?_?`h4@mnp??g?n???$c??
u4@mvp??g?????$c??
y?0?{??{?-|
?}???fJ
??Y?Z?g
efh
?ry@
|
??
???fL	???Y?[?g
klh
??y
@
|
??
???fJ
??\?Z?g
qrh
?ry@
|
??
???fL	???\?[?g
wxh
??y
@
|
??
????
??
?`*]_@2]a
/]b
+]c
?
>?