WhiteBox
DSA
Start coding DSA Beyond LeetCode System Design AI Engineering White Room
RoadmapProblem sets
Quizzes Dan Ladder Contests Templates Graph Editor
Guides Library
Login Sign up
Sign up Log in

Workspaces

Start coding DSA Beyond LeetCode System Design AI Engineering White Room

DSA

Overview Roadmap Problem sets Quizzes Dan Ladder Contests Templates Graph Editor CP Guessr

Library

Library Guides

Community

Leaderboard Contributors Refer & Earn Cosmetics

Tools

Resume Reviewer Job Boards Changelog

Graphs 0/61

DSA 0 of 360 problems solved
0%
Overview

Curriculum

    1. BFS 0/10
    2. DFS 0/13
    3. Grid traversal 0/10
    4. Topological sort 0/11
    5. Union-find (DSU) 0/10
    6. Dijkstra and shortest paths 0/8
      1. Shortest paths in weighted graphs
      2. Dijkstra 0/8
      3. Bellman-Ford
      4. Floyd-Warshall
  1. DSA
  2. / Graphs

Dijkstra and shortest paths · 2 of 4

Dijkstra

Find the distances from one source when no weight is negative by settling the closest vertex with a min-heap, and adapt the method to another measure of a path, to extra state and to counting shortest paths.

3,523 words · 16 min read

Lesson Problems8 Reading5
  • cp-algorithms.com Dijkstra on sparse graphs Compares a set that deletes old entries with the priority_queue that skips stale ones, the version used in this lesson. cp-algorithms.com (opens in a new tab)
  • ocw.mit.edu Lecture 13: Dijkstra’s Algorithm Grows the set of vertices in order of distance, proves it correct and compares an array, a binary heap and a Fibonacci heap as the priority queue, dense graphs against sparse. ocw.mit.edu (opens in a new tab)

More links3

  • CP-Algorithms – Dijkstra's Algorithmcp-algorithms.com (opens in a new tab)
  • Dijkstra's Algorithmprogramiz.com (opens in a new tab)
  • CF Blog – Dijkstra's Algorithm: Optimizations and Variantscodeforces.com (opens in a new tab)
Lesson: Dijkstra
Overview Roadmap Problem sets Log in