Method tsort

Perform a single step in a recursive depth-first-search traversal of the target dependency tree. The current target is first set to the "visiting" state, and pushed onto the "visiting" stack. An exception is then thrown if any child of the current node is in the visiting

(final String root, final Hashtable<String, Target> targetTable,
                             final Hashtable<String, String> state, final Stack<String> visiting,
                             final Vector<Target> ret)