4 ms·
The devil is usually in the details, are you sure you're not missing a 'k' factor in your O() complexity? In your shoes I'd try to set up some benchmarks and o
by adriancr 5y ago
The devil is usually in the details, are you sure you're not missing a 'k' factor in your O() complexity?
In your shoes I'd try to set up some benchmarks and other algorithms and compare, just for the learning experience. Try and fiddle with large V/E/k factors and compare. Check out some profiling tools, etc.
If all goes well you could just publish a library, that should count as prior work, nobody can come and steal your glory if you do wish to make it public..
- eezurr 5y agoIm almost certain I am not missing any k factor. I've been carefully checking for that. The algorithm would have fallen apart on any unweighted graph with hundreds of nodes with at least 2 connections each. EDIT: PS I read the paper you linked before your ninja edit :)
- adriancr 5y agoApologize for the ninja edit, removed the link by mistake, here's the link again: https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf https://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf