All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

    • com.google.common.graph.Graphs.class Maven / Gradle / Ivy

    ????4?&com/google/common/graph/GraphConstants
+com/google/common/graph/GraphsBridgeMethods()V

com/google/common/graph/Graphedges()Ljava/util/Set;
java/util/Setsize()I

isDirected()Z
nodes
 !com/google/common/collect/MapsnewHashMapWithExpectedSize(I)Ljava/util/HashMap;#$%iterator()Ljava/util/Iterator;'()*java/util/IteratorhasNext',-.next()Ljava/lang/Object;
01234com/google/common/graph/GraphssubgraphHasCycleC(Lcom/google/common/graph/Graph;Ljava/util/Map;Ljava/lang/Object;)Z67com/google/common/graph/Network69:allowsParallelEdges66=>?asGraph!()Lcom/google/common/graph/Graph;
0ABChasCycle"(Lcom/google/common/graph/Graph;)ZEjava/util/ArrayDeque
DH9com/google/common/graph/Graphs$NodeAndRemainingSuccessors
GJK(Ljava/lang/Object;)VMNOPKjava/util/DequeaddLastMRSisEmptyMUV.
removeLastMXY.peekLast	G[\]nodeLjava/lang/Object;	G_`aremainingSuccessorsLjava/util/Queue;cdefg
java/util/Mapget&(Ljava/lang/Object;)Ljava/lang/Object;i-com/google/common/graph/Graphs$NodeVisitState	hklmCOMPLETE/Lcom/google/common/graph/Graphs$NodeVisitState;	hopmPENDINGcrstput8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
vwx
successors#(Ljava/lang/Object;)Ljava/util/Set;
Dz{(Ljava/util/Collection;)V}R~java/util/Queue}??.remove
0???canTraverseWithoutReusingEdgeF(Lcom/google/common/graph/Graph;Ljava/lang/Object;Ljava/lang/Object;)Z
?????com/google/common/base/Objectsequal'(Ljava/lang/Object;Ljava/lang/Object;)Z
?????$com/google/common/graph/GraphBuilderfromG(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/GraphBuilder;
????allowsSelfLoops)(Z)Lcom/google/common/graph/GraphBuilder;
????	immutable2()Lcom/google/common/graph/ImmutableGraph$Builder;
0???reachableNodes[(Lcom/google/common/graph/Graph;Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;
???$?&com/google/common/collect/ImmutableSet2()Lcom/google/common/collect/UnmodifiableIterator;
?????.com/google/common/graph/ImmutableGraph$BuilderputEdgeV(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/graph/ImmutableGraph$Builder;?java/util/HashSet
????contains(Ljava/lang/Object;)Z???addAll(Ljava/util/Collection;)Z
?????#com/google/common/collect/Iterableslimit+(Ljava/lang/Iterable;I)Ljava/lang/Iterable;?#?java/lang/Iterable
????build*()Lcom/google/common/graph/ImmutableGraph;?(Node %s is not an element of this graph.
?????$com/google/common/base/Preconditions
checkArgument((ZLjava/lang/String;Ljava/lang/Object;)V
?????!com/google/common/graph/TraverserforGraphQ(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;
????breadthFirst((Ljava/lang/Object;)Ljava/lang/Iterable;
????copyOf>(Ljava/lang/Iterable;)Lcom/google/common/collect/ImmutableSet;?.com/google/common/graph/Graphs$TransposedGraph
????
access$000Q(Lcom/google/common/graph/Graphs$TransposedGraph;)Lcom/google/common/graph/Graph;
???"(Lcom/google/common/graph/Graph;)V??"com/google/common/graph/ValueGraph?3com/google/common/graph/Graphs$TransposedValueGraph
????
access$100[(Lcom/google/common/graph/Graphs$TransposedValueGraph;)Lcom/google/common/graph/ValueGraph;
???'(Lcom/google/common/graph/ValueGraph;)V?0com/google/common/graph/Graphs$TransposedNetwork
????
access$200U(Lcom/google/common/graph/Graphs$TransposedNetwork;)Lcom/google/common/graph/Network;
???$(Lcom/google/common/graph/Network;)V
????$com/google/common/graph/EndpointPair	isOrdered
???.target
???.source
?orderedL(Ljava/lang/Object;Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;java/util/Collection
?	
expectedNodeCount)(I)Lcom/google/common/graph/GraphBuilder;
??
(()Lcom/google/common/graph/MutableGraph;?$com/google/common/graph/MutableGraphaddNode??
?)com/google/common/graph/ValueGraphBuilderQ(Lcom/google/common/graph/ValueGraph;)Lcom/google/common/graph/ValueGraphBuilder;
	.(I)Lcom/google/common/graph/ValueGraphBuilder;
? -()Lcom/google/common/graph/MutableValueGraph;"#)com/google/common/graph/MutableValueGraph"?v?'()edgeValueOrDefaultJ(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
+,-.gjava/util/ObjectsrequireNonNull"01)putEdgeValue
345?6&com/google/common/graph/NetworkBuilderK(Lcom/google/common/graph/Network;)Lcom/google/common/graph/NetworkBuilder;
38	9+(I)Lcom/google/common/graph/NetworkBuilder;
3;?<*()Lcom/google/common/graph/MutableNetwork;>?&com/google/common/graph/MutableNetwork>6BCxoutEdges6EFG
incidentNodes:(Ljava/lang/Object;)Lcom/google/common/graph/EndpointPair;
?IJgadjacentNode>LMNaddEdge9(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Z
?PQ.nodeU
?ST.nodeV??6
3YZ9expectedEdgeCount\!Not true that %s is non-negative.
?^?_(ZLjava/lang/String;I)V
?a?b(ZLjava/lang/String;J)VdNot true that %s is positive.CodeLineNumberTableLocalVariableTablethis Lcom/google/common/graph/Graphs;graphLcom/google/common/graph/Graph;numEdgesIvisitedNodesLjava/util/Map;LocalVariableTypeTableTN;$Lcom/google/common/graph/Graph;RLjava/util/Map;
StackMapTableMethodParameters	Signature=(Lcom/google/common/graph/Graph;)Z$(Lcom/google/common/graph/Network;)Znetwork!Lcom/google/common/graph/Network;%Lcom/google/common/graph/Network<**>;((Lcom/google/common/graph/Network<**>;)ZstatenextNodetop;Lcom/google/common/graph/Graphs$NodeAndRemainingSuccessors;prevpreviousNode	startNodestackLjava/util/Deque;@Lcom/google/common/graph/Graphs$NodeAndRemainingSuccessors;SLjava/util/Deque;>;?java/lang/Object?(Lcom/google/common/graph/Graph;Ljava/util/Map;TN;)Z"Lcom/google/common/graph/Graph<*>;I(Lcom/google/common/graph/Graph<*>;Ljava/lang/Object;Ljava/lang/Object;)Z"RuntimeVisibleParameterAnnotationsLjavax/annotation/CheckForNull;transitiveClosureI(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/ImmutableGraph;
reachableNodeLjava/util/Set;
pairwiseMatch0Lcom/google/common/graph/ImmutableGraph$Builder;Ljava/util/Set;5Lcom/google/common/graph/ImmutableGraph$Builder;i(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/ImmutableGraph;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;
successorNodeLjava/lang/Iterable;subgraph&Lcom/google/common/graph/MutableGraph;Ljava/lang/Iterable<+TN;>;+Lcom/google/common/graph/MutableGraph;?(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;?(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;?(Lcom/google/common/graph/Network;Ljava/lang/Iterable<+TN;>;)Lcom/google/common/graph/MutableNetwork;G(Lcom/google/common/graph/Graph;)Lcom/google/common/graph/MutableGraph;copyg(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)IvalueRuntimeInvisibleAnnotations8Lcom/google/errorprone/annotations/CanIgnoreReturnValue;(J)JJ
checkPositive
SourceFileGraphs.javaRuntimeVisibleAnnotations9Lcom/google/common/graph/ElementTypesAreNonnullByDefault;$Lcom/google/common/annotations/Beta;InnerClassesNodeAndRemainingSuccessorsNodeVisitState?&com/google/common/graph/ImmutableGraphBuilderTransposedGraphTransposedValueGraphTransposedNetwork10e/*??f4ghi	BCei*?	?<??*??*????*???M*??"N-?&?-?+:*,?/??????f2@ABD*E,H-I;JXKbLdNgOg*X\]ijk]lm;.nop X\qijr;.nst??c'?ujvw	Bxe?<*?5?,*?8?#*?;?*?<?	???*?<?@?f\
]^0_2ag<yzp<y{t2uyv|
34e|	?DY?FN-?GY,?I?L-?Q??-?T?G:-?W?G:-?L?Z:???Z:?^?L+?b?h:?j?
-?TW????n??+?n?qW?DY*?u?y?^?^?|?,?^?:*???-?GY?I?L??>-?TW+?j?qW??(?fjklnp*q5r=tDuTv\wixqyxz{|?}??????????????????????gf
i<}m?~]*??5???D?\]T??]?jk?no??]???p\	?~q*??5???D?\qT??q?jr?ns??q???t9?M?6GG?D??(?h	?5?
c?Mu
jn?v?
??ew*??,+?????f???g jk~]?]pj?tu
j~?v???	??e??*??????L*??M*??"M,?&?5,?+N*-????:?&??+:+-??W????ȧ???Y??M*??"N-?&?|-?+:,???f*??:,??W6?":?&???+:?????:		?&?	?+:
+
??W????????+???fV????1?N?V?Y?_?g???????????????????????gf
N?]1(\]?	T]
?0Q]?[???O?m?n\]g?n??jk???p\	N?q1(\q?	Tq
?0Qq?[???n\qg?n??jr???tc?!?'??'???'?8
?'?'?#?'??
?'?ujv?	??er*?+???+??*??+?ϸӰf
??gjk\]pjr\qu	j\v?	??ey#*??*?*?י*?׸ٰ??Y*?ݰf?	???g#jkp#jrtujv?	??ey#*???*?*??*??尻?Y*??f
	g#j?p#j?tujv?	??ey#*?5?*?*??*???Y*??f	"g#yzp#y?tuyv???eb*???*??*????*?f&')g??p??tu?v?	??e??+??*??+?????
*???M+??N-?&?-?+:,?W???,??"N-?&?N-?+:*?u?":?&?*?+:,????,?W??ҧ??,?f6
%=FIf?????g>=	\]??]f@\]?jk??%???p>=	\q??qf@\q?jr??%???t)	F?'??'??'-??u	jv?	??e??+??*?+?????
*??M+??N-?&?-?+:,?!W???,?$?"N-?&?\-?+:*?%?":?&?8?+:,?$???,*?&?*?/W??ħ??,?f>)*+%,=-F.I/f0?1?3?6?3?8?9?:g>=	\]?)?]fN\]?j???%???p>=	\q?)?qfN\q?j???%???t)	F"?"'??'??';??u	jv?	??e??+??*?2+???7?:?
*?2?:M+??N-?&?-?+:,?=W???,?@?"N-?&?_-?+:*?A?":?&?;?+:*?D?H:,?@???,?KW??????,?f:HIJ%K=LFMINfO?P?Q?R?T?U?VgH=	\]??]?,?]fQ\]?yz??%???pH=	\q??q?,??fQ\q?y???%???t)	F>?>'??'??'>??u	yv?	??e!p*??*????L*??"M,?&?,?+N+-?W???*?	?"M,?&?,?+??N+-?O-?R?W???+?f"[\2]:^=_\`kanbg*2\]\??pjkZ??p*2\q\??pjrZ??t?"'??'?$ujv?	??eG?*?*?U???L*?U?"M,?&?,?+N+-?!W???*?V?"M,?&?1,?+??N+-?O-?R*-?O-?R?&?*?/W???+?f6
ghi2j:k=l\n^obpgqwn}r?sg*2\]\!???j?l??p*2\q\!???j?l??t?""'??'?6ujv?	??e`?*?2*?W??7*?;??X?:L*?W?"M,?&?,?+N+-?=W???*?;?"M,?&?(,?+N*-?D:+?O?R-?KW???+?f6
xyz{ |$}@~HK?g?p?????g4@\]p??g?]?yz$c??p4@\qp??g???y?$c??t?0>'??'?-uyv???eK??[?]?f
??g?mt@u?????eM	???[?`?f
??g??t
@u?????eK??c?]?f
??g?mt@u?????eM	???c?`?f
??g??t
@u??????????2G0?h0?@???	?0?
?0?
?0?




    © 2015 - 2025 Weber Informatics LLC | Privacy Policy