Core Skill

• Dijkstra’s Algorithm
• Shortest path with weights

Problems

• Network Delay Time
• Path With Minimum Effort

Pattern

heap= [(dist,node)]

Insight

• Always expand smallest distance first