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 de.hg.codejam.tasks.io;

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;

public abstract class Writer {

	public static String generateOutputPath(String inputPath) {
		return inputPath.substring(0, inputPath.lastIndexOf('.') + 1) + "out";
	}

	public static void print(String[] output) {
		for (String s : output)
			System.out.println(s);
	}

	public static void write(String[] output) {
		for (int i = 0; i < output.length; i++)
			System.out.println(getCase(i + 1, output[i]));
	}

	public static void write(String[] output, String path) {
		try (BufferedWriter writer = new BufferedWriter(new FileWriter(path,
				false))) {
			for (int i = 0; i < output.length; i++) {
				writer.append(getCase(i + 1, output[i]));
				writer.newLine();
				writer.flush();
			}
		} catch (IOException e) {
			e.printStackTrace();
		}

	}

	private static String getCase(int number, String caseString) {
		return "Case #" + (number) + ": " + caseString;
	}

}
