It's a good approach, particularly well-suited for sparse adjacency situations. Have you looked at Graph? It has random graphs and all-pairs-shortest-path, so theoretically you could just enumerate the "bottom" nodes and iterate over them, doing all-pairs-shortest-paths to get the paths. Graph can print them too.

This is of course assuming that all you want to do is solve the problem. If you're needing to implement the graph algorithms for some other reason, you'll have a fair amount more work to do - but hashes of hashes (or arrays of arrays, for that matter) would work fine.

In reply to Re: Print all possible paths in a graph and some graph creation too! by pemungkah
in thread Print all possible paths in a graph and some graph creation too! by tsk1979

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.