(upstream_node, outgoing_edge_map)
| 99 | |
| 100 | |
| 101 | def get_outgoing_edges(upstream_node, outgoing_edge_map): |
| 102 | edges = [] |
| 103 | for upstream_label, downstream_infos in sorted(outgoing_edge_map.items()): |
| 104 | for downstream_info in downstream_infos: |
| 105 | downstream_node, downstream_label, downstream_selector = downstream_info |
| 106 | edges += [ |
| 107 | DagEdge( |
| 108 | downstream_node, |
| 109 | downstream_label, |
| 110 | upstream_node, |
| 111 | upstream_label, |
| 112 | downstream_selector, |
| 113 | ) |
| 114 | ] |
| 115 | return edges |
| 116 | |
| 117 | |
| 118 | class KwargReprNode(DagNode): |
no outgoing calls
no test coverage detected
searching dependent graphs…