[Graphs]

Author: loiane

examples/PacktDataStructuresAlgorithms.min.js

@@ -46,9 +46,9 @@ graph.addEdge('C', 'F');
 graph.addEdge('F', 'E');
 
 const result = DFS(graph);
-console.log(result.discovery);
-console.log(result.finished);
-console.log(result.predecessors);
+console.log('discovery', result.discovery);
+console.log('finished', result.finished);
+console.log('predecessors', result.predecessors);
 
 const fTimes = result.finished;
 s = '';

examples/PacktDataStructuresAlgorithms.min.js.map

@@ -46,7 +46,7 @@ export const depthFirstSearch = (graph, callback) => {
 const DFSVisit = (u, color, d, f, p, time, adjList) => {
   // console.log('discovered ' + u);
   color[u] = Colors.GREY;
-  d[u] = ++time;
+  d[u] = ++time.count;
   const neighbors = adjList.get(u);
   for (let i = 0; i < neighbors.length; i++) {
     const w = neighbors[i];
@@ -56,7 +56,7 @@ const DFSVisit = (u, color, d, f, p, time, adjList) => {
     }
   }
   color[u] = Colors.BLACK;
-  f[u] = ++time;
+  f[u] = ++time.count;
   // console.log('explored ' + u);
 };
 
@@ -67,7 +67,7 @@ export const DFS = graph => {
   const d = {};
   const f = {};
   const p = {};
-  const time = 0;
+  const time = { count: 0 };
   for (let i = 0; i < vertices.length; i++) {
     f[vertices[i]] = 0;
     d[vertices[i]] = 0;

examples/chapter11/03-DFS.js

@@ -20,7 +20,7 @@ export default class Graph {
       this.addVertex(b);
     }
     this.adjList.get(a).push(b);
-    if (!this.isDirected) {
+    if (this.isDirected !== true) {
       this.adjList.get(b).push(a);
     }
   }