🔢
Algorithms & Data
search
⌘Ctrlk
🔢
Algorithms & Data
  • Overview
    • 1. Sort
    • 2. Data Structures
    • 3. How to construct Algorithm? Paradigm
      • Greedy Algorithm
      • Dynamic Planning Techique
      • Dynamic Planning
      • Divide And Conquer
      • Brute force
      • Shortest path
        • BFS
        • Dijkstra algorithm: directed, shortest path
      • MST (Minimum Spanning Tree)
  • Algorithm Problems
    • Problem Sources
    • AlgoExpert
    • Daily Algorithms
  • Top 75 LeetCode Questions to Save Your Time
    • Source
    • Problems
  • 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 2 months ago