Allow faster computation of shortest path distances.

Add script accessor for distance values to avoid computing
distance for each pair for graph nodes (improves running time by
factor n^2 for those cases).