We describe a methodology for characterizing the relative structural importance of an arbitrary network edge by exploiting the properties of a k-shortest path algorithm. We introduce the metric Edge Gravity, measuring how often an edge occurs in any possible n... ...
