Produce a distance matrix between all terminal points of bridges in a graph where all the bridges are removed (i.e. path between 2 bridges should not cross intermediate bridges)
If termini belong to same bridge, calculate distance across that bridge between those termini.
[x] produce intra-bridge distance matrix (longest crossing distance between bridge interfaces)
[x] serialize actual edge paths for each interface pair in a useful and stable way so we can eventually re-map the results back to the full-complexity graph
For Yinglan Chen and Rubens Martins:
Produce a distance matrix between all terminal points of bridges in a graph where all the bridges are removed (i.e. path between 2 bridges should not cross intermediate bridges)
If termini belong to same bridge, calculate distance across that bridge between those termini.