Directed Graph Cycle Detection | Dataford Interview Questions

Given a directed graph with n nodes labeled 0 to n - 1, determine whether the graph contains at least one cycle.

Implement a function that returns True if the graph has a cycle, otherwise return False.

Formal Specification

Input:
- n, an integer representing the number of nodes.
- edges, a list of directed edges, where each edge is a pair [u, v] meaning there is an edge from u to v.
Output:
- Return a boolean value indicating whether the directed graph contains a cycle.

def has_cycle(n, edges):

Your question is Directed Graph Cycle Detection. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Given a directed graph with n nodes labeled 0 to n - 1, determine whether the graph contains at least one cycle.

Implement a function that returns True if the graph has a cycle, otherwise return False.

Input:
- n, an integer representing the number of nodes.
- edges, a list of directed edges, where each edge is a pair [u, v] meaning there is an edge from u to v.
Output:
- Return a boolean value indicating whether the directed graph contains a cycle.

def has_cycle(n, edges):

Your question is Directed Graph Cycle Detection. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.