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

import java.lang.reflect.Array;
import java.util.*;

public class ArrayUtil {
    static<T> T[] revers (T[] t){
        List<T> list = Arrays.asList(t);
        Collections.reverse(list);
        return (T[]) list.toArray();
    }

    static<T> Map<T,Integer> listToMap(List<T> list) {
        HashMap<T, Integer> map = new HashMap<>();
        for (int i = 0; i < list.size(); i++) {
            T t = list.get(i);
            map.put(t,i);
        }
        return map;
    }

    static <T> List<T> fromIndexList(List<Integer> inds, List<T> values) {
        ArrayList<T> ts = new ArrayList<>();
        for (Integer ind : inds) {
            ts.add(values.get(ind)) ;
        }
        return ts;
    }
}
