Re:C++ Programming Questions to Ask on Interview (2017)
by isaachier on Friday October 19, 2018 @08:40AM
(#18256277)
I just don't understand how this is possible. The only way to implement Dijkstra's algorithm in less than O(|V|^2) time is using a min-heap. In practice it might be rare to use heaps over ordered sets but it is one of the first tree structures I was taught in my data structures course.
Your explanation makes it quite clear and I guess now I know -- but it's not been common in anything I've ever seen.