private void addSubtraversal(T node, LinkedList<T> imports, Set<T> alreadyIncludedImports, NodePath<T> nodePath)
      throws ExecutionException {

    if (addNodeIfNotAlreadyIncluded(node, imports, alreadyIncludedImports)) {
      for (T inheritedFromParent : doTraverseGraphRecursively(node, nodePath)) {
        addNodeIfNotAlreadyIncluded(inheritedFromParent, imports, alreadyIncludedImports);
      }
    }
  }
private void addSubtraversal ( T node , LinkedList < T > imports , Set < T > alreadyIncludedImports , NodePath < T > nodePath ) throws ExecutionException { if ( addNodeIfNotAlreadyIncluded ( node , imports , alreadyIncludedImports ) ) { for ( T inheritedFromParent : doTraverseGraphRecursively ( node , nodePath ) ) { addNodeIfNotAlreadyIncluded ( inheritedFromParent , imports , alreadyIncludedImports ) ; } } }
Add a sub-traversal for a neighboring node.