- **Greedy Approach:** The algorithm always selects the nod…

- **Greedy Approach:** The algorithm always selects the node with the smallest known distance from the starting node.
- **Non-negative Weights:** It requires that all edge weights be non-negative; negative weights can lead to incorrect results.
- **Single-Source Shortest Path:** Primarily used to compute the shortest paths from one node to all other nodes in the graph.