|go ahead... be a heretic|
Re^6: Finding All Paths From a Graph From a Given Source and End Nodeby LanX (Cardinal)
|on Nov 02, 2010 at 09:39 UTC||Need Help??|
Did you also benchmark other code? Like in this post?
(I can't see the point in copying around the %seen hash :) ¹
Furthermore this code can be easily linearized to avoid the function-call overhead...
Anyway the benchmarks highly depend on the nature of those "randomly generated graphs".
In general there are still plenty of possible optimizations left to speed up such a search.
1) or even the current path of a DFS.