(from_name, to_name)
| 262 | return |
| 263 | |
| 264 | def draw_edge(from_name, to_name): |
| 265 | if highlight_pairs: |
| 266 | for highlight_from, highlight_to in highlight_pairs: |
| 267 | if from_name == highlight_from and to_name == highlight_to: |
| 268 | graph.edge(from_name, to_name, color=light_green) |
| 269 | return |
| 270 | elif from_name == highlight_to and to_name == highlight_from: |
| 271 | graph.edge(from_name, to_name, color=light_green, dir='back') |
| 272 | return |
| 273 | # if no need to highlight, color gray |
| 274 | if should_build_agent_cluster(agent): |
| 275 | |
| 276 | graph.edge( |
| 277 | from_name, |
| 278 | to_name, |
| 279 | color=light_gray, |
| 280 | ) |
| 281 | else: |
| 282 | graph.edge(from_name, to_name, arrowhead='none', color=light_gray) |
| 283 | |
| 284 | await draw_node(agent) |
| 285 | if hasattr(agent, 'sub_agents'): |
no test coverage detected