finding shortest path from undirected graph

Question

I have two problems; I have to find shortest path from an undirected, weighted graph

1. sending goods to single destination
2. sending goods to multiple destinations

Assume all edge weights are positve numbers.

Send me suitable algorithms for both problems.

Answer 1

Dijkstra's algorithm will solve both of your problems.