Re: Finding All Paths From a Graph From a Given Source and End Node


Keep It Simple, Stupid
	PerlMonks

Re: Finding All Paths From a Graph From a Given Source and End Node

by Tux (Canon)

on Oct 28, 2010 at 14:48 UTC ( [id://868045]=note: print w/replies, xml )

Need Help??

in reply to Finding All Paths From a Graph From a Given Source and End Node

Did you already look at the Graph module? It has a chapter in the man page that awfully sounds like your quest:

   All-Pairs Shortest Paths (APSP)
       For either a directed or an undirected graph, return the APSP o
+bject
       describing all the possible paths between any two vertices of t
+he
       graph.  If no weight is defined for an edge, 1 (one) is assumed
+.
[download]

Enjoy, Have FUN! H.Merijn