graph = DiGraph(
    nodes={
        "A": DiGraphNode(name="A", edges=[
            DiGraphEdge(target="B"),
            DiGraphEdge(target="D")  # This branch could be affected
        ]),
        "B": DiGraphNode(name="B", edges=[DiGraphEdge(target="C")]),
        "C": DiGraphNode(name="C", edges=[DiGraphEdge(target="A", condition="loop")]),  # Valid cycle
        "D": DiGraphNode(name="D", edges=[]),
        "E": DiGraphNode(name="E", edges=[])  # Disconnected component
    }
)

def dfs(node_name: str) -> bool:
    # ... setup code ...
    for edge in self.nodes[node_name].edges:
        if target not in visited:
            if dfs(target):
                return True  # Early return without cleanup
        elif target in rec_stack:
            # ... cycle validation ...
            return True  # Early return without cleanup
    
    rec_stack.remove(node_name)  # Only reached if no cycles found
    path.pop()
    return False

def dfs(node_name: str) -> bool:
    # ... setup code ...
    cycle = False  # Track cycle detection locally
    for edge in self.nodes[node_name].edges:
        if target not in visited:
            if dfs(target):
                cycle = True  # Continue processing instead of early return
        elif target in rec_stack:
            # ... cycle validation ...
            cycle = True  # Continue processing instead of early return
    
    rec_stack.remove(node_name)  # Always executed
    path.pop()
    return cycle  # Return accumulated result