Function cycleInGraph

graphs/cyle-in-graph.js:4–15

(edges)

// time O(v + e) | O(v) space - where v is the number of vertices and e the number of edges in the graph

function cycleInGraph(edges) {
  const numberOfNodes = edges.length;
  const visitedVetices = new Array(numberOfNodes).fill(false);
  const inStack = new Array(numberOfNodes).fill(false);

  for (let node = 0; node < numberOfNodes; node++) {
    if (visitedVetices[node]) continue;
    const containsCycle = DFS(node, edges, visitedVetices, inStack);
    if (containsCycle) return true;
  }
  return false;
}

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