MCPcopy Create free account
hub / github.com/loiane/javascript-datastructures-algorithms / enhancedDFSVisit

Function enhancedDFSVisit

src/13-graph/dfs.js:68–81  ·  view source on GitHub ↗
(vertex, color, discovery, finished, predecessors, time, adjList)

Source from the content-addressed store, hash-verified

66}
67
68const enhancedDFSVisit = (vertex, color, discovery, finished, predecessors, time, adjList) => {
69 color[vertex] = Colors.GREY;
70 discovery[vertex] = ++time.count; // Record discovery time
71 const neighbors = adjList.get(vertex);
72 for (let i = 0; i < neighbors.length; i++) {
73 const neighbor = neighbors[i];
74 if (color[neighbor] === Colors.WHITE) {
75 predecessors[neighbor] = vertex; // Record predecessor
76 enhancedDFSVisit(neighbor, color, discovery, finished, predecessors, time, adjList);
77 }
78 }
79 color[vertex] = Colors.BLACK;
80 finished[vertex] = ++time.count; // Record finish time
81};
82
83module.exports = { depthFirstSearch, enhancedDepthFirstSearch};

Callers 1

enhancedDepthFirstSearchFunction · 0.70

Calls 1

getMethod · 0.45

Tested by

no test coverage detected