Function dfs

codewiki/src/be/dependency_analyzer/topo_sort.py:214–224

(node)

    if not root_nodes:
        logger.warning("No root nodes found in the graph, using arbitrary starting point")
        root_nodes = list(acyclic_graph.keys())[:1]  # Use the first node as starting point

    # Track visited nodes
    visited = set()
    result = []

    # DFS function that processes dependencies first
    def dfs(node):
        if node in visited:
            return
        visited.add(node)

        # Visit all dependencies first