comment on

Once you build your Graph there are algorithms to return all paths https://metacpan.org/dist/Graph/view/lib/Graph.pod#All-Pairs-Shortest-Paths-(APSP) (see https://metacpan.org/dist/Graph/view/lib/Graph.pod#all_paths therein). If standard algorithms exist for what you want to do then they will most-likely beat any low-level DIY algorithms. So, use Graph algorithms if you have a Graph.

Also, links can be resolved at construction time with, say, https://metacpan.org/pod/Cwd#abs_path-and-friends or readlink. Caveat: querying the filesystem with said functions will be slower than your methods I guess. But it will be safer.

bw, bliako

In reply to Re: experiencing slowness due to matching algorithm by bliako
in thread experiencing slowness due to matching algorithm by ovedpo15

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


P is for Practical
	PerlMonks