Function DFS

graphs/cyle-in-graph.js:17–33

(node, edges, visitedVertices, inStack)

}

function DFS(node, edges, visitedVertices, inStack) {
  visitedVertices[node] = true;
  inStack[node] = true;

  const neighbors = edges[node];

  for (const neighbor of neighbors) {
    if (!visitedVertices[neighbor]) {
      const containsCycle = DFS(neighbor, edges, visitedVertices, inStack);
      if (containsCycle) return true;
    } else if (inStack[neighbor]) {
      return true;
    }
  }
  inStack[node] = false;
  return false;
}

const edges = [[1, 3], [2, 3, 4], [0], [], [2, 5], []];