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

Path finding in graph theory



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: Comparison of Mathematica on Various Computers
  • Next by Date: Inserted Objects wont Print!!
  • Prev by thread: Comparison of Mathematica on Various Computers
  • Next by thread: Re: Path finding in graph theory