Re: Shortest path algorithm
- To: mathgroup at smc.vnet.net
- Subject: [mg45318] Re: Shortest path algorithm
- From: "Steve Luttrell" <luttrell at _removemefirst_westmal.demon.co.uk>
- Date: Tue, 30 Dec 2003 04:14:23 -0500 (EST)
- References: <bsoebr$enc$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
You could use ShortestPath which is to be found in the DiscreteMath`Combinatorica` package. -- Steve Luttrell West Malvern, UK "gio" <gio at nospam.com> wrote in message news:bsoebr$enc$1 at smc.vnet.net... > Dear all, > > Currently I am working on a subproject for my PhD. In this subproject I > need to do some analysis on a network. > > I have about 1000 vertices. Every vertex is connected to about 20 > (definately not more) vertices. > > I need to know what the shortest path is from every vertex to all other > vertices in the network. Total distance/weight is not that relevant to > show up. > > Are there any Mathematica algorithms out there that can deal with this > stuff? Or can anybody help me by telling me how to tackle this problem? > > Best regards, > > Ralph > > ralphmic(at)inter(dot)nl(dot)net > replace (at) by @ > replace (dot) by . >