I have a digraph where each arc has a positive weight. I'm just wondering if there is an algorithm that finds minimum weight shortest paths from a node to all the other nodes with a running time $O(n + A)$ where $A$ is the sum of the weights. 
minimum shortest path from node a to all the other nodes, running time?
algorithms;graphs;shortest path