Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2007
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2007

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

Search the Archive

Finding paths in graphs

  • To: mathgroup at smc.vnet.net
  • Subject: [mg72524] Finding paths in graphs
  • From: OT <montoz at iol.it>
  • Date: Thu, 4 Jan 2007 07:00:23 -0500 (EST)
  • Organization: C.U. srl News Server

Hi all,

I have a big oriented graph in a Mathematica notebook, described as a 
list of rule (i.e the graph is something like {1->2 , 1->3, 2->3, ... }) 
  and I want to find all the path from vertex 'a' to vertex 'b'...

How can I do that ? The function ShortestPath doesn't work on graphs 
defined in this way, and moreover this function only return one of the 
shortest paths, while I'm looking for all the existing paths...

thanks,
OT


  • Prev by Date: Re: Re: Re: programming problem about elements
  • Next by Date: Re: List representation using element position
  • Previous by thread: Re: Multiple streams in Write
  • Next by thread: Re: Finding paths in graphs