Adam Hartshorne wrote:
Hi All,
I know how to calculate the all-pair shortest paths matrix on an
undirected graph. I was wondering how I could extend this to calculate
the all-pair average path, or if not a simple extension an efficient
algorithm to compute this.
Any help much appreciated,
Adam
This post is off-topic here (see FAQ 5.9). You probably want to post to
the Boost users list:
http://boost.org/more/mailing_lists.htm#users
Cheers! --M