public abstract class com.google.common.graph.Traverser<N>
  minor version: 0
  major version: 59
  flags: flags: (0x0421) ACC_PUBLIC, ACC_SUPER, ACC_ABSTRACT
  this_class: com.google.common.graph.Traverser
  super_class: java.lang.Object
{
  public static <N> com.google.common.graph.Traverser<N> forGraph(com.google.common.graph.SuccessorsFunction<N>);
    descriptor: (Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;
    flags: (0x0009) ACC_PUBLIC, ACC_STATIC
    Code:
      stack=3, locals=1, args_size=1
        start local 0 // com.google.common.graph.SuccessorsFunction graph
         0: .line 93
            aload 0 /* graph */
            invokestatic com.google.common.base.Preconditions.checkNotNull:(Ljava/lang/Object;)Ljava/lang/Object;
            pop
         1: .line 94
            new com.google.common.graph.Traverser$GraphTraverser
            dup
            aload 0 /* graph */
            invokespecial com.google.common.graph.Traverser$GraphTraverser.<init>:(Lcom/google/common/graph/SuccessorsFunction;)V
            areturn
        end local 0 // com.google.common.graph.SuccessorsFunction graph
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    2     0  graph  Lcom/google/common/graph/SuccessorsFunction<TN;>;
    Signature: <N:Ljava/lang/Object;>(Lcom/google/common/graph/SuccessorsFunction<TN;>;)Lcom/google/common/graph/Traverser<TN;>;
    MethodParameters:
       Name  Flags
      graph  

  public static <N> com.google.common.graph.Traverser<N> forTree(com.google.common.graph.SuccessorsFunction<N>);
    descriptor: (Lcom/google/common/graph/SuccessorsFunction;)Lcom/google/common/graph/Traverser;
    flags: (0x0009) ACC_PUBLIC, ACC_STATIC
    Code:
      stack=3, locals=1, args_size=1
        start local 0 // com.google.common.graph.SuccessorsFunction tree
         0: .line 171
            aload 0 /* tree */
            invokestatic com.google.common.base.Preconditions.checkNotNull:(Ljava/lang/Object;)Ljava/lang/Object;
            pop
         1: .line 172
            aload 0 /* tree */
            instanceof com.google.common.graph.BaseGraph
            ifeq 3
         2: .line 173
            aload 0 /* tree */
            checkcast com.google.common.graph.BaseGraph
            invokeinterface com.google.common.graph.BaseGraph.isDirected:()Z
            ldc "Undirected graphs can never be trees."
            invokestatic com.google.common.base.Preconditions.checkArgument:(ZLjava/lang/Object;)V
         3: .line 175
      StackMap locals:
      StackMap stack:
            aload 0 /* tree */
            instanceof com.google.common.graph.Network
            ifeq 5
         4: .line 176
            aload 0 /* tree */
            checkcast com.google.common.graph.Network
            invokeinterface com.google.common.graph.Network.isDirected:()Z
            ldc "Undirected networks can never be trees."
            invokestatic com.google.common.base.Preconditions.checkArgument:(ZLjava/lang/Object;)V
         5: .line 178
      StackMap locals:
      StackMap stack:
            new com.google.common.graph.Traverser$TreeTraverser
            dup
            aload 0 /* tree */
            invokespecial com.google.common.graph.Traverser$TreeTraverser.<init>:(Lcom/google/common/graph/SuccessorsFunction;)V
            areturn
        end local 0 // com.google.common.graph.SuccessorsFunction tree
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    6     0  tree  Lcom/google/common/graph/SuccessorsFunction<TN;>;
    Signature: <N:Ljava/lang/Object;>(Lcom/google/common/graph/SuccessorsFunction<TN;>;)Lcom/google/common/graph/Traverser<TN;>;
    MethodParameters:
      Name  Flags
      tree  

  public abstract java.lang.Iterable<N> breadthFirst(N);
    descriptor: (Ljava/lang/Object;)Ljava/lang/Iterable;
    flags: (0x0401) ACC_PUBLIC, ACC_ABSTRACT
    Signature: (TN;)Ljava/lang/Iterable<TN;>;
    MethodParameters:
           Name  Flags
      startNode  

  public abstract java.lang.Iterable<N> breadthFirst(java.lang.Iterable<? extends N>);
    descriptor: (Ljava/lang/Iterable;)Ljava/lang/Iterable;
    flags: (0x0401) ACC_PUBLIC, ACC_ABSTRACT
    Signature: (Ljava/lang/Iterable<+TN;>;)Ljava/lang/Iterable<TN;>;
    MethodParameters:
            Name  Flags
      startNodes  

  public abstract java.lang.Iterable<N> depthFirstPreOrder(N);
    descriptor: (Ljava/lang/Object;)Ljava/lang/Iterable;
    flags: (0x0401) ACC_PUBLIC, ACC_ABSTRACT
    Signature: (TN;)Ljava/lang/Iterable<TN;>;
    MethodParameters:
           Name  Flags
      startNode  

  public abstract java.lang.Iterable<N> depthFirstPreOrder(java.lang.Iterable<? extends N>);
    descriptor: (Ljava/lang/Iterable;)Ljava/lang/Iterable;
    flags: (0x0401) ACC_PUBLIC, ACC_ABSTRACT
    Signature: (Ljava/lang/Iterable<+TN;>;)Ljava/lang/Iterable<TN;>;
    MethodParameters:
            Name  Flags
      startNodes  

  public abstract java.lang.Iterable<N> depthFirstPostOrder(N);
    descriptor: (Ljava/lang/Object;)Ljava/lang/Iterable;
    flags: (0x0401) ACC_PUBLIC, ACC_ABSTRACT
    Signature: (TN;)Ljava/lang/Iterable<TN;>;
    MethodParameters:
           Name  Flags
      startNode  

  public abstract java.lang.Iterable<N> depthFirstPostOrder(java.lang.Iterable<? extends N>);
    descriptor: (Ljava/lang/Iterable;)Ljava/lang/Iterable;
    flags: (0x0401) ACC_PUBLIC, ACC_ABSTRACT
    Signature: (Ljava/lang/Iterable<+TN;>;)Ljava/lang/Iterable<TN;>;
    MethodParameters:
            Name  Flags
      startNodes  

  private void <init>();
    descriptor: ()V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=1, locals=1, args_size=1
        start local 0 // com.google.common.graph.Traverser this
         0: .line 317
            aload 0 /* this */
            invokespecial java.lang.Object.<init>:()V
            return
        end local 0 // com.google.common.graph.Traverser this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lcom/google/common/graph/Traverser<TN;>;
}
Signature: <N:Ljava/lang/Object;>Ljava/lang/Object;
SourceFile: "Traverser.java"
NestMembers:
  com.google.common.graph.Traverser$GraphTraverser  com.google.common.graph.Traverser$GraphTraverser$1  com.google.common.graph.Traverser$GraphTraverser$2  com.google.common.graph.Traverser$GraphTraverser$3  com.google.common.graph.Traverser$GraphTraverser$BreadthFirstIterator  com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator  com.google.common.graph.Traverser$GraphTraverser$DepthFirstIterator$NodeAndSuccessors  com.google.common.graph.Traverser$Order  com.google.common.graph.Traverser$TreeTraverser  com.google.common.graph.Traverser$TreeTraverser$1  com.google.common.graph.Traverser$TreeTraverser$2  com.google.common.graph.Traverser$TreeTraverser$3  com.google.common.graph.Traverser$TreeTraverser$BreadthFirstIterator  com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator  com.google.common.graph.Traverser$TreeTraverser$DepthFirstPostOrderIterator$NodeAndChildren  com.google.common.graph.Traverser$TreeTraverser$DepthFirstPreOrderIterator
InnerClasses:
  private final GraphTraverser = com.google.common.graph.Traverser$GraphTraverser of com.google.common.graph.Traverser
  private final Order = com.google.common.graph.Traverser$Order of com.google.common.graph.Traverser
  private final TreeTraverser = com.google.common.graph.Traverser$TreeTraverser of com.google.common.graph.Traverser
    RuntimeInvisibleAnnotations: 
      com.google.common.annotations.Beta()