๐Ÿ”ข
Algorithms & Data
Ctrlk
  • 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
Powered by GitBook
On this page
  1. Overview
  2. 3. How to construct Algorithm? Paradigm
  3. Shortest path

BFS

https://codermun-log.tistory.com/294#:~:text=๋‘ ๋…ธ๋“œ ์‚ฌ์ด์— ์กด์žฌํ• ,๊ฐ€์žฅ ์งง์€ ๊ฒฝ๋กœ๋ฅผ ๋งํ•œ๋‹ค.&text=๊ฐ€์ค‘์น˜ ๊ทธ๋ž˜ํ”„์—์„œ๋Š” ๋ณดํ†ต ์—ฃ์ง€,๊ฐ€ ์ตœ๋‹จ ๊ฒฝ๋กœ๊ฐ€ ๋œ๋‹ค.&text=์ฃผ์–ด์ง„ ๊ทธ๋ž˜ํ”„์—์„œ ๋‘ ๋…ธ๋“œ,์ตœ๋‹จ ๊ฒฝ๋กœ ์•Œ๊ณ ๋ฆฌ์ฆ˜์ด๋ผ ๋ถ€๋ฅธ๋‹ค.

PreviousShortest pathNextDijkstra algorithm: directed, shortest path

Last updated 16 days ago