javaScript Map

              }
                   }
 }
 
                         vertices.push(v);
         adjList.set(v, []);
     }
              adjList.get(v).push(w);
         adjList.get(w).push(v);
     }
                                    s += vertices[i] + '->';
                                           s += neighbors[j] + '';
             };
             s += '\n';
         };
              }
 
                           queue =          queue.enqueue(v);
                                       neighbors = adjList.get(u);
             color[u] = 'grey';
                                                                    color[w] = 'grey';
                     queue.enqueue(w);
                 }
             };
             color[u] = 'black';
                              callback(u);
             }
         }
     }
 
                           queue =              d = [],
             pred = [];
         queue.enqueue(v);
                      d[vertices[i]] = 0;
             pred[vertices[i]] =          }
                                       neighbors = adjList.get(u);
             color[u] = 'gery';
                                                                    color[w] = 'gery';
                     d[w] = d[u] + 1;
                     pred[w] = u;
                     queue.enqueue(w);
                 }
             }
             color[u] = 'black';
         }
                      distances: d,
             predecessors: pred
         }
     }
 
                                                     dfsVisit(vertices[i], color, callback);
             }
         }
     }
 
 
              color[u] = 'gery';
                      callback(u);
         }
                                                             dfsVisit(w, color, callback);
             }
         }
         color[u] = 'black';
     }
 
 
 
                                d = [],
             f = [],
             p = [];
         time = 0;
                      f[vertices[i]] = 0;
             d[vertices[i]] = 0;
             p[vertices[i]] =  
         }
                                       DFSVisit(vertices[i], color, d, f, p);
             }
         }
                      discovery: d,
             finished: f,
             predecsssors: p
         }
     }
              console.log('discoverd      ' + u);
         color[u] = 'gery';
         d[u] = ++time;
                                                             p[w] = u;
                 DFSVisit(w, color, d, f, p);
 
             }
         }
         color[u] = 'black';
         f[u] = ++time;
         console.log('explored    ' + u);
     }
 
 }
        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');
 
 
 console.log(graph.toString());
 
                    color[myVertices[i]] = 'white';
     };
      };
 
      console.log("VIsited vertex:" + value);
 }
 console.log('---------------')
 graph.bfs(myVertices[0], printNode);
 console.log('---------------')
  console.log(shortestPathA);
 console.log('---------------')
 
                path =               path.push(v);
     }
     path.push(fromVertex);
                   s += '-' + path.pop();
     }
     console.log(s);
 }
 
 console.log('---------------')
 
 graph.dfs(printNode);
 
 console.log('---------------')
 graph.DFS();