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

public class Googler implements Comparable {

	/**
	 * @param args
	 */
	private int base;
	private int remainder;
	private int max;
	private int total;
	private boolean mayBeSurprising;
	
	public Googler(int score){
		total = score;
		remainder = score %3 ;
		base = (score - remainder) /3;
		
	}
	
	
	public int getTotal(){
		return total;
	}
	
	public int getMax(boolean canbeSur){
		if(canbeSur){
			if(remainder <= 1){
				if(base !=0){
					return base + 1;
				}
				else{
					return base;
				}
			}
			else{
				return base + 2;
			}
		}
		else{
			if(remainder <= 1){
				return base + remainder;
			}
			else{
				return base+1;
			}
			
		}
	}
	

	@Override
	public int compareTo(Object o) {
		// TODO Auto-generated method stub
		int otherTotal = ((Googler)o).getTotal();
		if(total < otherTotal){
			return -1;
		}
		else if (total == otherTotal){
			return 0;
		}
		else{
			return 1;
		}
		
	}
	
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
	}

}
