You have added the most effective pathfinding algorithm to your toolkit. Weighted graphs have costs on edges. BFS fails when weights vary. Dijkstra greedily processes closest nodes first, guaranteeing correct shortest distances.
Core pattern: priority queue + relaxation. Time: . Handles non-negative weights only. For negative weights, you need Bellman-Ford. Practice on classic problems until the pattern is automatic.