Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1998
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1998

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

Search the Archive

Re: Path finding in graph theory



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
> 
> -------------------------------------------------------------------------
> 
> 
> 




  • Prev by Date: RE: Frontend problems under NT 4.0
  • Next by Date: Solving for coefficients...
  • Prev by thread: Path finding in graph theory
  • Next by thread: Inserted Objects wont Print!!