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

import java.util.HashSet;
import java.util.Iterator;

/**
 *
 * @author dannocz
 */
public class Googler {
    
    private int score; //A score per googler
    private HashSet<Triplet> triplets; //A set of triplets per score
    private int surprisedCases;

    public Googler(int score, int surprisedCases) {
        this.score = score;
        this.surprisedCases=surprisedCases;
        this.triplets= new HashSet<Triplet>();
    }
    
    public void addTriplet(Triplet triplet)
    {
        triplets.add(triplet);
    }    
    
    public boolean result(int p){
        Iterator iterator=triplets.iterator();
        
        while (iterator.hasNext()) {
            Triplet triplet = (Triplet)iterator.next();
            if(triplet.compliesWithP(p) && triplet.surprised())
                return true;
        }
        
         iterator=triplets.iterator();
        while (iterator.hasNext()) {
            Triplet triplet = (Triplet)iterator.next();
            if(triplet.compliesWithP(p) && !triplet.surprised() && surprisedCases>0)
            {
                surprisedCases--;
                return true;
            }
        }
        return false;
    }

    public int getScore() {
        return score;
    }

    public void setScore(int score) {
        this.score = score;
    }

    public HashSet<Triplet> getTriplets() {
        return triplets;
    }

    public void setTriplets(HashSet<Triplet> triplets) {
        this.triplets = triplets;
    }
    
    
}
