iLdZddlmZmZmZmZddlmZddlm Z GddZ y)zGraph topology builder utility for cycle detection and topological sorting. This module provides stateless utilities for building execution order of graphs, supporting both global graphs and scoped subgraphs (e.g., within cycles). )DictListSetAny)Node) CycleDetectorc peZdZdZedeeefdee efdZ edeeefdeeee fdee edeee effdZ edeee efdee edeeeee ffd Z edeeefdeeee fdeeeee ffd Zedeeefdeeeee ffd Zy ) GraphTopologyBuildera] Graph topology structure builder. Responsibilities: 1. Detect cycles (based on CycleDetector) 2. Build super-node graphs 3. Perform topological sorting Features: - Stateless (pure static methods) - Can be used for both global graphs and local subgraphs - Does not depend on specific GraphContext instances nodesreturnc8t}|j|S)z Detect cycles in the given node set. Args: nodes: Dictionary of nodes to analyze Returns: List of cycles, where each cycle is a set of node IDs )r detect_cycles)r detectors F/Users/bowang/.openclaw/workspace/ChatDev/workflow/topology_builder.pyrz"GraphTopologyBuilder.detect_cycless!?%%e,,edgescyclescNi}i}t|D]#\}}d|}t||<|D]}|||< %|jD]}||vsd|}t||<|||< |D]9} | d} | d} | |vs| |vr|| } || } | | k7s&|| j| ;|S)ag Create a super-node graph where each cycle is treated as a single node. Args: nodes: Node dictionary edges: Edge configuration list (only edges to consider) cycles: List of detected cycles Returns: Super-node dependency graph: {super_node_id: set(predecessor_super_node_ids)} super_cycle_node_fromto) enumeratesetkeysadd)r rr super_nodes node_to_superi cycle_nodes super_node_idnode_id edge_config from_nodeto_node from_superto_supers rcreate_super_node_graphz,GraphTopologyBuilder.create_super_node_graph)s"  (/NA{*1#.M),K &&)6 g&'0zz|Gm+"'y 1 -0U M*)6 g& $!K#F+I!$'G%)=&y1J$W-HX%H%))*5!rsuper_node_graphc |jDcic]\}}|t|}}}|jDcgc] \}}|dk(s |}}}g}i} t|D]\} } d| d| } | | d| d| <|r|dd} |jg}| D]}|j dr*| |}|j d|dt |d d n7|j d r&|jd d }|j d |d|D]E}|||vs ||j|||xxdzcc<||dk(s5|j |G|r|j ||r|Scc}}wcc}}w)a Perform topological sort on super-node graph to determine execution order. Args: super_node_graph: Super-node dependency graph cycles: List of cycles for mapping super-nodes to cycle info Returns: Execution layers, where each layer contains items that can be executed in parallel. Format: [ [{"type": "node", "node_id": "A"}, {"type": "cycle", "cycle_id": "...", "nodes": [...]}], [...] ] rcycle__)cycle_idr rNcycler-r )typer-r rnoder/r") itemslenrclear startswithappendlistreplaceremove)r)r super_node predecessors in_degreer1degreereadyexecution_layers cycle_lookuprr r- current_layer layer_items cycle_datar" dependents rtopological_sort_super_nodesz1GraphTopologyBuilder.topological_sort_super_nodes]s,-=,B,B,D ,D( L L) ),D  +4//*;K*;,$v{*;K '/NA{s!K=1H$$0L<s+ ,0!!HM KKMK+ ((8!-j!9J&& '$.z$:!%j&9!:(  **73(00"=G&& &#*( "2I!%5i%@@(3:::F!),1,$Y/14!LL3 "2%,2 '' 4AD i LsE3 E9E9ctj|}|stj|Stj|||}tj ||S)a One-stop method to build execution order. Combines cycle detection, super-node construction, and topological sorting. Args: nodes: Node dictionary edges: Edge configuration list Returns: Execution layers )r rbuild_dag_layersr(rG)r rr super_graphs rbuild_execution_orderz*GraphTopologyBuilder.build_execution_ordersY"&33E:'88? ?*BB 5& $@@   rc|jDcic]\}}|t|j}}}|jDcgc] \}}|dk(s |}}}g}|r|Dcgc]}d|d }}|j|g}|D][}||jD]G} || j xxdzcc<|| j dk(s-|j| j I]|}|r|Scc}}wcc}}wcc}w)z Build topological layers for DAG (Directed Acyclic Graph). Args: nodes: Node dictionary Returns: Layers in execution item format rr1r2r3)r4r5r=r8 successorsid) r r"r1r>degfrontierlayersrD next_frontier successors rrIz%GraphTopologyBuilder.build_dag_layerss)"' !.  S**+ +!.  )2(9 (9 SAXG(9   ('G G4'  MM+ &M#!&w!:!:Iill+q0+ .!3%,,Y\\:";$ %H  5  s C/ C5C5' C;N)__name__ __module__ __qualname____doc__ staticmethodrstrrrrrrr(rGrKrIrrr r s  -T#t)_ -c#h - -1CI1DcN#1SX1 c3s8m  11fG sCH}-G SXG  d4S>" #G G R CI DcN#  d4S>" #  <$S$Y$Dd38n9M4N$$rr N) rWtypingrrrrentity.configsrworkflow.cycle_managerrr rZrrr^s$ ('0__r