Detecting Cycles in Network Topology | Dataford Interview Questions

Write an algorithm to detect cycles in a network topology graph.

Implement detect_cycle(graph, directed), where graph is an adjacency-list dictionary and directed selects directed or undirected cycle rules. Return True if any cycle exists, otherwise return False. The graph may contain disconnected components, self-loops, and nodes with no outgoing edges.

Constraints

graph is a dictionary mapping string node identifiers to adjacency lists of strings
0 <= number of graph keys <= 1000
The graph can contain disconnected components
For undirected graphs, each edge is represented in both endpoint adjacency lists
Self-loops are valid graph edges
directed is a boolean

Function Signature

def detect_cycle(graph, directed):

Your question is Detecting Cycles in Network Topology. 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.

Problem

Write an algorithm to detect cycles in a network topology graph.

Constraints

graph is a dictionary mapping string node identifiers to adjacency lists of strings
0 <= number of graph keys <= 1000
The graph can contain disconnected components
For undirected graphs, each edge is represented in both endpoint adjacency lists
Self-loops are valid graph edges
directed is a boolean

Function Signature

def detect_cycle(graph, directed):

Your question is Detecting Cycles in Network Topology. 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.