Path finding in graph theory
- To: mathgroup@smc.vnet.net
- Subject: [mg11880] Path finding in graph theory
- From: Gary Clemo <Gary.Clemo@Bristol.ac.uk>
- Date: Fri, 3 Apr 1998 03:45:36 -0500
- Organization: University of Bristol, England
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 -------------------------------------------------------------------------