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

Re: Path finding in graph theory

• To: mathgroup@smc.vnet.net
• Subject: [mg12134] Re: [mg11880] Path finding in graph theory
• From: Robert Pratt <rpratt@math.unc.edu>
• Date: Mon, 27 Apr 1998 01:46:17 -0400

Do you want to allow repeated vertices or not?

There is no built-in command, but I can write one for you.

Rob Pratt
Department of Mathematics
The University of North Carolina at Chapel Hill CB# 3250, 331 Phillips
Hall
Chapel Hill, NC  27599-3250

rpratt@math.unc.edu

http://www.math.unc.edu/Grads/rpratt/

On Fri, 3 Apr 1998, Gary Clemo wrote:

> I'm modelling a computer network as a graph and would like to find an
> algorithm in Mathematica that will return all 'routes' from one vertex
> to another.  There are some algorithms within the DiscreteMaths package
> that will return the shortest path between two vertices, but none (it
> appears) that return all paths.  Am I missing something? Thanks
> Gary
> 
> -------------------------------------------------------------------------
> 
> Gary Clemo
> Networks and Protocols Group
> Centre for Communications Research, University of Bristol Room 5.11,
> Merchant Venturers Building Woodland Road, Bristol, BS8 1UB.  UK.
> 
> Tel: +44 (0) 117 954 5199
> Fax: +44 (0) 117 954 5206
> GSM: +44 (0) 385 567510
> 
> -------------------------------------------------------------------------
> 
> 
>