🔢
Algorithms & Data
search
Ctrlk
  • Overview
    • 1. Sortchevron-right
    • 2. Data Structureschevron-right
    • 3. How to construct Algorithm? Paradigmchevron-right
      • Greedy Algorithmchevron-right
      • Dynamic Planning Techique
      • Dynamic Planning
      • Divide And Conquer
      • Brute force
      • Shortest pathchevron-right
        • BFS
        • Dijkstra algorithm: directed, shortest path
      • MST (Minimum Spanning Tree)chevron-right
  • Algorithm Problems
    • Problem Sources
    • AlgoExpertchevron-right
    • Daily Algorithmschevron-right
  • Top 75 LeetCode Questions to Save Your Time
    • Source
    • Problemschevron-right
  • Tip
    • Page 2
    • LinkedList
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Overviewchevron-right
  2. 3. How to construct Algorithm? Paradigm

Shortest path

BFSchevron-rightDijkstra algorithm: directed, shortest pathchevron-right
PreviousBrute forcechevron-leftNextBFSchevron-right

Last updated 1 month ago