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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 *
 * @author Hasier Rodriguez
 */
public final class In {

    private In() {
    }

    public static String[] read(String path, int mult) throws FileNotFoundException, IOException {
        System.out.println("IN");
        File f = new File(path);
        BufferedReader br = new BufferedReader(new FileReader(f));
        String[] array = new String[Integer.parseInt(br.readLine()) * mult];
        String s = br.readLine();
        int i = 0;
        while (s != null) {
            array[i] = s;
            System.out.println(s);
            i++;
            s = br.readLine();
        }
        System.out.println();
        System.out.println();
        br.close();
        return array;
    }
}
