the subpath algorithm

subpath.java

/**
 * visitedSoFar contains all nodes that have been traversed
 * bestPathSoFar should be populated with only the subpath of visitedSoFar that contains no dead ends
 */

for( int j = 0; j < visitedSoFar.size(); j++ ) {
    for( int i = visitedSoFar.size() - 1; i > j; i-- ) {
        if( visitedSoFar.get( i ).equals( visitedSoFar.get( j ) ) ) {
            j = i;
        }
    }
    bestPathSoFar.add( visitedSoFar.get( j ) );
}