Shortest path (weighted)

The Dijkstra algorithm finds shortest paths when edge weights are:

Sign in to solve this challenge

Use your college email to start solving, earn XP, build a streak, and climb your college leaderboard. It is free.