Greetings,
This is very simple, and obviously I'm missing something trivial, but I still don't get it.
An algorithm is said to run in polynomial time if it runs in O(n^K) time.
That's why dijkstra for example, who runs in O(V^2), runs in polynomial time.
That said, my doubt is...