(edges)
| 1363 | |
| 1364 | def edge_connects(p1, p2) -> bool: |
| 1365 | def edges_to_set(edges): |
| 1366 | return set(map(obj_to_bbox, edges)) |
| 1367 | |
| 1368 | if p1[0] == p2[0]: |
| 1369 | common = edges_to_set(intersections[p1]["v"]).intersection( |
no outgoing calls
no test coverage detected
searching dependent graphs…