Dijkstra's algorithm
Gabow and Tarjan provided a modification of Dijkstra's algorithm for single-source shortest path that produces an MBSA. Their algorithm runs in "O"("E" + "V" log "V") time if Fibonacci heap used.