***** To join INSNA, visit http://www.sfu.ca/~insna/ *****
On Thu, May 22, 2003 at 09:35:30AM -0400, Guy Hagen wrote:
> Is anyone aware of a fast (non-distributed) algorithm for all-pairs shortest
> path calculation?
The method of choice depends on whether your graphs are weighted
and/or have some structure. See, e.g.,
Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms
2nd ed., MIT Press, 2001
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.sfu.ca/~insna/). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.