Comparing Prim's v/s Dijkstra's

In this video, we discuss the differences between the core insights behind Prim's algorithm and Dijkstra's algorithm. A comparison allows us to appreciate their distinct characteristics and applications in practical scenarios.
For example,
Prim's can be used for,
1. Electrical Grid Design: Designing the layout of electrical grids to minimize the total wiring cost while ensuring all substations are connected.
2. Transportation Networks: Planning railways or road networks to ensure the least amount of construction cost while connecting all the cities or stations.
Dijkstra's on the other hand, can be used for,
1. Routing Protocols: Utilized in internet protocols like OSPF (Open Shortest Path First) to find the shortest path for data packets from the source to the destination across various nodes (routers).
2. Public Transport Routes: Assists in planning bus or train routes to minimize travel time for passengers.