edge_crossing assumes a single connected component #16
Description
The edge_crossing algorithm uses an impossible triangle calculation that only makes sense in the context of a single connected component. This may be an easy fix by running the impossible crossing calculation only on each subgraph individually?