By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
445,742 Members | 1,044 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 445,742 IT Pros & Developers. It's quick & easy.

Average All-Pair Shortest Path on a Graph

P: n/a
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
Jan 23 '06 #1
Share this Question
Share on Google+
1 Reply


P: n/a
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

Jan 23 '06 #2

This discussion thread is closed

Replies have been disabled for this discussion.