Implement Dijkstra's algorithm to find shortest paths from a source node in a weighted graph.