Êþº¾4š !d "e fgh !ij kl mn fop mqr k Ts !t !uv w !xy w !z{ w T| T} U~ U €�‚ƒInsertionOrder InnerClasses„ TraversalsuccessorFunction,Lcom/google/common/graph/SuccessorsFunction; Signature1Lcom/google/common/graph/SuccessorsFunction;/(Lcom/google/common/graph/SuccessorsFunction;)VCodeLineNumberTableLocalVariableTablethis#Lcom/google/common/graph/Traverser;LocalVariableTypeTable(Lcom/google/common/graph/Traverser;4(Lcom/google/common/graph/SuccessorsFunction;)VforGraphQ(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;graphq(Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;forTreetree StackMapTable breadthFirst((Ljava/lang/Object;)Ljava/lang/Iterable; startNodeLjava/lang/Object;TN;(TN;)Ljava/lang/Iterable;*(Ljava/lang/Iterable;)Ljava/lang/Iterable; startNodesLjava/lang/Iterable; validated(Lcom/google/common/collect/ImmutableSet;Ljava/lang/Iterable<+TN;>;-Lcom/google/common/collect/ImmutableSet;5(Ljava/lang/Iterable<+TN;>;)Ljava/lang/Iterable;depthFirstPreOrderdepthFirstPostOrder newTraversal/()Lcom/google/common/graph/Traverser$Traversal;4()Lcom/google/common/graph/Traverser$Traversal;validate>(Ljava/lang/Iterable;)Lcom/google/common/collect/ImmutableSet;nodecopy…†I(Ljava/lang/Iterable<+TN;>;)Lcom/google/common/collect/ImmutableSet;T(Lcom/google/common/graph/SuccessorsFunction;Lcom/google/common/graph/Traverser$1;)Vx0x1%Lcom/google/common/graph/Traverser$1;(Ljava/lang/Object; SourceFileTraverser.javaRuntimeVisibleAnnotations-Lcom/google/errorprone/annotations/DoNotMock;valuefCall forGraph or forTree, passing a lambda or a Graph with the desired edges (built with GraphBuilder)RuntimeInvisibleAnnotations$Lcom/google/common/annotations/Beta; ,- ,‡ˆ ‰Š*com/google/common/graph/SuccessorsFunction ()#com/google/common/graph/Traverser$1 ,‹!com/google/common/graph/BaseGraph Œ�%Undirected graphs can never be trees. Ž�com/google/common/graph/Network'Undirected networks can never be trees.#com/google/common/graph/Traverser$2 �‘ =C PQ#com/google/common/graph/Traverser$3 ,’ KC#com/google/common/graph/Traverser$4 LC#com/google/common/graph/Traverser$5 “Q ”• –� —˜ ™>!com/google/common/graph/Traverserjava/lang/Object0com/google/common/graph/Traverser$InsertionOrder+com/google/common/graph/Traverser$Traversal&com/google/common/collect/ImmutableSetjava/util/Iterator()V$com/google/common/base/Preconditions checkNotNull&(Ljava/lang/Object;)Ljava/lang/Object;[(Lcom/google/common/graph/SuccessorsFunction;Lcom/google/common/graph/SuccessorsFunction;)V isDirected()Z checkArgument(ZLjava/lang/Object;)Vof<(Ljava/lang/Object;)Lcom/google/common/collect/ImmutableSet;N(Lcom/google/common/graph/Traverser;Lcom/google/common/collect/ImmutableSet;)VcopyOfiterator2()Lcom/google/common/collect/UnmodifiableIterator;hasNextnext()Ljava/lang/Object; successors!!"()*+ ,-.h*·*+¸Àµ±/EFG012()314(+*5 67.F »Y**·°/b0  8)3  8+*9 :7.Š4*Á™*À¹  ¸ *Á ™*À ¹ ¸ »Y**·°/´µ·¸*º0 4;)3 4;+<*9=>.Y *+¸¶°/â0 12 ?@3 14 ?A*B=C.x*+·M»Y*,·°/ ðñ0 12DE FG3 14DH FI*JK>.Y *+¸¶°/0 12 ?@3 14 ?A*BKC.x*+·M»Y*,·°/ '(0 12DE FG3 14DH FI*JL>.Y *+¸¶°/P0 12 ?@3 14 ?A*BLC.x*+·M»Y*,·°/ ^_0 12DE FG3 14DH FI*JMN*OPQ.È,+¸M,¶N-¹™-¹:*´¹ W§ÿã,°/klm'n*o0* R@,12,DE'SG3* RA,14,DH'SI<ý TUú*V,W.V*+·±/B0 12X)YZ3 14*[\]^ _`sabc%:#!$D &!'