Consider an undirected graph G(V,E,W), where V represents the nodes, E represents the undirected edges, and W represents the edge weights. What is the worst-case computational complexity of Dijkstra's single-source shortest path algorithm when using a heap data structure? Select the tightest bound.