There's more than one way to do things | |
PerlMonks |
Re: Algorithm Complexity and Determinism of Graph Moduleby ownlifeful (Beadle) |
on Jun 11, 2017 at 11:03 UTC ( [id://1192515]=note: print w/replies, xml ) | Need Help?? |
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
In Section
Seekers of Perl Wisdom
|
|