[Jprogramming] all paths in a graph

[Aai]

,. _2{ ;@:(( <@,"1 0 G ({:"1@]#~(={."1))~{:)&.>)^:(a:~:{.)^:a: <0
┌────────────────────┐
│0 1 2 3 5 7 9 11 13 │
├────────────────────┤
│0 1 2 3 5 7 9 11 14 │
├────────────────────┤
│0 1 2 3 5 7 9 11 15 │
├────────────────────┤
│0 1 2 3 5 7 10 12 16│
...
├────────────────────┤
│0 1 2 4 5 8 10 11 13│
├────────────────────┤
│0 1 2 4 5 8 10 11 14│
├────────────────────┤
│0 1 2 4 5 8 10 11 15│
└────────────────────┘

Ugly stop predicate and I'm not really content with the embedded G.



On 24-04-12 12:39, R.E. Boss wrote:
> 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

-- 
Met vriendelijke groet,
@@i = Arie Groeneveld