Outer loop has O(V) iterations, and PQ updates are O(logV).

Implementing "find (edge e=(s,t,w)) satisfying ..."

1. try all e ∈ E ... cost = O(VE)
2. classical Djiskstra approach ... cost = O(V²)
   • consider only edges (s,t,w) where s ∈ vSet and t ∉ vSet
3. use a PQueue to find edge to relax
   • cost = V*Cost_join + V*Cost_leave + ~E*Cost_reorder

In case 3, cost is dependent on efficiency of PQueue.