[Date Index] [Thread Index] [Author Index]

Re: All pairs shortest paths

• To: mathgroup at smc.vnet.net
• Subject: [mg111489] Re: All pairs shortest paths
• From: "Jon Harrop" <usenet at ffconsultancy.com>
• Date: Tue, 3 Aug 2010 06:37:43 -0400 (EDT)
• References: <i2eaij$q7d$1@smc.vnet.net> <i2jq2j$gr8$1@smc.vnet.net> <i2ub6h$jga$1@smc.vnet.net> <i30gik$mfm$1@smc.vnet.net>

Bah, my solution is wrong because it loses the relationship between the 
input vertex names and the indices into the adjacency matrix. So I don't 
know how to solve this problem using Mathematica. :-(

How does AdjacencyMatrix work?

"Jon Harrop" <usenet at ffconsultancy.com> wrote in message 
news:i30gik$mfm$1 at smc.vnet.net...
> "Jon Harrop" <usenet at ffconsultancy.com> wrote in message
> news:i2ub6h$jga$1 at smc.vnet.net...
>> Does Mathematica really not provide a built-in function to compute
>> all-pairs
>> shortest paths?
>
> FWIW, this is quite tricky so I have blogged a solution here:
>
> http://mathematicanews.blogspot.com/2010/07/all-pairs-shortest-paths.html
>
> Cheers,
> Jon.
>
>