Shortest Path with a Must-Visit Vertex

You’ve probably used Dijkstra’s algorithm to find the shortest path between two points in a graph. But what if you’re given an extra…