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;
    }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package uk.co.epii.codejam.common;

/**
 *
 * @author jim
 */
public abstract class AbstractProcessor implements Processor {
    
    public Output process(Input input) {
        int lines = Integer.parseInt(input.getHeader()[0]);
        String[] data = input.getData();
        if (lines != data.length)
            throw new IllegalArgumentException("There are a different number "
                    + "of data lines to the number specified in the header");
        String[] out = new String[lines];
        for (int i = 0; i < lines; i++) {
            out[i] = processLine(data[i]);
        }
        return new Output(out);
    }
}
