
On a very large graph, is there an easy way to find the shortest path connecting any given two nodes?



Not that I know of. It would be a nice feature addition, though. I imagine you would select two vertices and then ask NodeXL to calculate (and perhaps highlight) the shortest path between them.
 Tony

