package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

package teardrop.jam2012.qr.dancing;

import org.testng.annotations.Test;

import java.io.Reader;
import java.io.StringReader;
import java.io.StringWriter;
import java.io.Writer;

public class SetSolverTest {
	private static final String testInput =
		"4\n" +
        "3 1 5 15 13 11\n" +
        "3 0 8 23 22 21\n" +
        "2 1 1 8 0\n" +
        "6 2 8 29 20 8 18 18 21";
	private static final String testOutput =
		"Case #1: 3\n" +
        "Case #2: 2\n" +
        "Case #3: 1\n" +
        "Case #4: 3\n";

	@Test
	public void testSolve() throws Exception {
		Reader reader = new StringReader(testInput);
		Writer writer = new StringWriter();
		SetSolver solver = new SetSolver(reader, writer);
		solver.solve();
		String result = writer.toString();
		assert testOutput.equals(result) : String.format("Got \n%s\ninstead of \n%s\n", result, testOutput);
	}
}
