Graph.js

function Dictionary(){
    var items={};
    this.has=function(key){
        return items.hasOwnProperty(key);
    };
    this.set=function(key,value){
        items[key]=value;
    };
    this.delete=function(key){
        if(this.has(key)){
            delete items[key];
            return true;
        }
        return false;
    };
    this.get=function(key){
        return this.has(key)?items[key]:undefined;
    };
    this.values=function(){
        var values=[];
        for(var k in items){
            if(this.has(k)){
                values.push(items[k]);
            }
        }
        return values;
    };
    this.keys=function(){
        return Object.keys[items];
    };
    this.getItems=function(){
        return items;
    };
}

function Queue(){
    var items=[];
    this.enqueue=function(element){
        items.push(element);
    };
    this.dequeue=function(element){
        return items.shift();
    };
    this.isEmpty=function(){
        return items.length===0;
    }
}

function Stack(){
    var items=[];
    this.push=function(element){
        items.push(element);
    };
    this.pop=function(){
        return items.pop();
    }
    this.isEmpty=function(){
        return items.length===0;
    }
}

function Graph(){
    var vertices=[];
    var adjList=new Dictionary();
    this.addVertex=function(v){
        vertices.push(v);
        adjList.set(v,[]);
    };
    this.addEdge=function(v,w){
        adjList.get(v).push(w);
        adjList.get(w).push(v);
    };
    this.toString=function(){
        var s='';
        for(var i=0;i<vertices.length;i++){
            s+=vertices[i]+'->';
            var neighbors=adjList.get(vertices[i]);
            for(var j=0;j<neighbors.length;j++){
                s+=neighbors[j]+' ';
            }
            s+='\n';
        }
        return s;
    };
    var initializeColor=function(){
        var color=[];
        for(var i=0;i<vertices.length;i++){
            color[vertices[i]]='white';
        }
        return color;
    };
    this.bfs=function(v,callback){
        var color=initializeColor();
        queue=new Queue();
        queue.enqueue(v);
        while(!queue.isEmpty()){
            var u=queue.dequeue();
            neighbors=adjList.get(u);
            color[u]='grey';
            for(var i=0;i<neighbors.length;i++){
                var w=neighbors[i];
                if(color[w]==='white'){
                    color[w]='grey';
                    queue.enqueue(w);
                }
            }
            color[u]='black';
            if(callback){
                callback(u);
            }
        }
    }
    this.BFS=function(v){
        var color=initializeColor(),
            queue=new Queue(),
            d=[],
            pred=[];
            queue.enqueue(v);
        for(var i=0;i<vertices.length;i++){
            d[vertices[i]]=0;
            pred[vertices[i]]=null;
        }
        while(!queue.isEmpty()){
            var u=queue.dequeue(),
                neighbors=adjList.get(u);
            color[u]='grey';
            for(i=0;i<neighbors.length;i++){
                var w=neighbors[i];
                if(color[w]==='white'){
                color[w]='grey';
                d[w]=d[u]+1;
                pred[w]=u;
                queue.enqueue(w);
                }
            }
            color[u]='black';
        }
        return{
            distances:d,
            predecessors:pred
        };
    };
    var dfsVisit=function(u,color,callback){
        color[u]='grey';
        if(callback){
            callback(u);
        }
        var neighbors=adjList.get(u);
        for(var i=0;i<neighbors.length;i++){
            var w=neighbors[i];
            if(color[w]==='white'){
                dfsVisit(w,color,callback);
            }
        }
        color[u]='black';
    };
    this.dfs=function(callback){
        var color=initializeColor();
        for(var i=0;i<vertices.length;i++){
            if(color[vertices[i]]==='white'){
                dfsVisit(vertices[i],color,callback);
            }
        }
    };
    var time=0;
    var DFSVisit=function(u,color,d,f,p){
        console.log('discoverd '+u);
        color[u]='grey';
        d[u]=++time;
        var neighbors=adjList.get(u);
        for(var i=0;i<neighbors.length;i++){
            var w=neighbors[i];
            if(color[w]==='white'){
                p[w]=u;
                DFSVisit(w,color,d,f,p);
            }
        }
        color[u]='black';
        f[u]=++time;
        console.log('explored '+u);
    }

    this.DFS=function(){
        var color=initializeColor(),
            d=[],
            f=[],
            p=[];
            time=0;
            for(var i=0;i<vertices.length;i++){
                f[vertices[i]]=0;
                d[vertices[i]]=0;
                p[vertices[i]]=null;
            }
            for(i=0;i<vertices.length;i++){
                if(color[vertices[i]]==='white'){
                    DFSVisit(vertices[i],color,d,f,p);
                }
            }
            return {
                discovery:d,
                finished:f,
                predecessors:p
            };
          };
}
var graph=new Graph();
var myVertices=['A','B','C','D','E','F','G','H','I'];
for(var i=0;i<myVertices.length;i++){
    graph.addVertex(myVertices[i]);
}
graph.addEdge('A','B');
graph.addEdge('A','C');
graph.addEdge('A','D');
graph.addEdge('C','D');
graph.addEdge('C','G');
graph.addEdge('D','G');
graph.addEdge('D','H');
graph.addEdge('B','E');
graph.addEdge('B','F');
graph.addEdge('E','I');
var printNode=function(value){
    console.log('Visited vertex: '+value);
}