I would like to know other solutions. And perhaps learn why it took me so long.
R.E. Boss > -----Oorspronkelijk bericht----- > Van: programming-boun...@jsoftware.com > [mailto:programming-boun...@jsoftware.com] Namens Markus Schmidt-Gröttrup > Verzonden: dinsdag 24 april 2012 12:59 > Aan: Programming forum > Onderwerp: Re: [Jprogramming] all paths in a graph > > I have not investigated in finding an expression for all paths. > What for? Efficient graph algorithms as Dijkstra shortest path > algorithms avoid the flood of these possibilities. > > Could you give an idea, what are you aiming at? (Beside staying young) > > Greetings, > > Markus > > Am 24.04.2012 12:39, schrieb R.E. Boss: > > Given the directed graph G (see<http://www.jsoftware.com/jwiki/RE%20Boss> > > http://www.jsoftware.com/jwiki/RE%20Boss) by > its edges > > > > > > > > |: G > > > > 0 1 2 2 3 4 4 5 5 6 7 7 8 9 10 10 11 11 11 12 12 12 > > > > 1 2 3 4 5 6 5 7 8 7 9 10 10 11 12 11 13 14 15 16 15 14 > > > > > > > > determine all (different) paths from root 0 to the leaves. > > > > > > > > This took me quite some time(days!). Am I getting old? > > > > > > > > > > > > R.E. Boss > > > > > > > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > > > > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
