Re: Algorithm Complexity and Determinism of Graph Module

Thanks for the thoughtful replies, everyone. Judicious use of sort made the algorithm deterministic.

The algorithm aims to determine whether a given undirected graph contains any Hamiltonian Cycles. I am still calculating the Big-O complexity, and would appreciate any help.

Here is a link to the source code on GitHub.

There is also a demo at: ownlifeful.com

Comment on Re: Algorithm Complexity and Determinism of Graph Module Select or Download Code

Replies are listed 'Best First'.
Re^2: Algorithm Complexity and Determinism of Graph Module by Discipulus (Canon) on Jun 11, 2017 at 22:29 UTC
sorry if I cant help you ownlifeful but with your project and a poem as first posts you have my warmest welcome to the monastery! L* There are no rules, there are no thumbs.. Reinvent the wheel, then learn The Wheel; may be one day you reinvent one of THE WHEELS.	[reply] [d/l]
Re^3: Algorithm Complexity and Determinism of Graph Module by ownlifeful (Beadle) on Jun 12, 2017 at 13:21 UTC
Thank you for the warm welcome, Discipulus. I have lurked around the Monastery for years, and have reaped much benefit from the discourse of the Monks. Glad to share the Perl journey with my fellow Monks.	[reply]