gistfile1.java

import java.util.Stack;

/**
 *
 */
public class Circuits {
    class Position {
        int node;
        int cost; Position(int node, int cost) { this.node = node; this.cost = cost; }
    }
	public int howLong(String[] connects, String[] costs) {
        int max = 0;
        Stack<Position> toVisit = new Stack<Position>();
        boolean[] visited = new boolean[connects.length];
        int unvisited = connects.length;
        while (toVisit.size() > 0 || unvisited > 0) {
            if (toVisit.size() < 1) {
                int start = 0;
                for (; visited[start]; start++);
                toVisit.push(new Position(start, 0));
            }

            Position cursor = toVisit.pop();
            if (connects[cursor.node].length() > 0) {
                String[] adjacent = connects[cursor.node].split(" ");
                String[] adjcosts = costs[cursor.node].split(" ");
                for (int i = 0; i < adjacent.length; i++)
                    toVisit.push(new Position(Integer.parseInt(adjacent[i]),
                        Integer.parseInt(adjcosts[i]) + cursor.cost));
            }

            visited[cursor.node] = true;
            unvisited--;

            if (cursor.cost > max)
                max = cursor.cost;
        }
        return max;
	}
}