dijkstra.js

var DijkstraAlgo = {


dijkstra : async function(start , finish){
    visitedNodes = [] ; 
     q = [] ; 
    start.distance = 0 ; 
    var parent = new Map() ; 
    parent.set(start , -1) ; 
    q.push(start); 
    
    console.log("q" , q) ;  
    while(q.length != 0){
        q.sort(cmp) ; 
        var closestNode = q[0] ; 
        q.shift() ; 

        visitedNodes.push(closestNode) ; 
        if(closestNode == finish){
           var r = DijkstraAlgo.setPath(parent , visitedNodes ,startNode , finishNode);
           
           return parent ; 
        }

        var neighbor = closestNode.neighbors ; 
        for (var i = 0 ; i < neighbor.length ; i++){
            if(neighbor[i].distance > (closestNode.distance + 1)){
                parent.set(neighbor[i] , closestNode) ; 
                neighbor[i].distance = closestNode.distance + 1 ; 
                q.push(neighbor[i]) ; 
            }
        }
    }
    animate("No Path found") ; 
    enable();
    
} ,

setPath : async function (parent , visitedNodes ,startNode ,  finishNode){
   await DijkstraAlgo.updateVisited(visitedNodes);
    crawl = parent.get(finishNode) ; 
    while(crawl != -1){
        await sleep(1);
        if(crawl != startNode && crawl != finishNode && crawl != null)
            crawl.state = 'p' ;
        crawl = parent.get(crawl) ; 
    }
    enable();
    return "Path found" ; 
},

updateVisited : async function(visitedNodes){
    for (var i = 0 ; i < visitedNodes.length ; i++){
        if(visitedNodes[i].state != 's' && visitedNodes[i].state != 'f' && visitedNodes[i].state != 'p' ){
            await sleep(1) ; 
            visitedNodes[i].state = 'd' ; 
        }
    }
    return new Promise(function(resolve , reject){
        setTimeout(() => {
            const check = true ; 
            if(check){
                resolve();
            }
            else{
                reject();
            }
        }, 1000);
    });
}


};