docs: finalized wiki integrity maintenance (v3.0 standard) - pruned 1400+ stubs and fixed 11k+ ghost links
This commit is contained in:
@@ -1,8 +1,8 @@
|
||||
---
|
||||
id: [[P-Reinforce]]-AI-DIJKSTRA
|
||||
id: [[P-Reinforce|P-Reinforce]]-AI-DIJKSTRA
|
||||
category: "10_Wiki/💡 Topics/Programming & Language"
|
||||
confidence_score: 0.99
|
||||
tags: [Dijkstra, Algorithm, Pathfinding, [[Graph Theory]]]
|
||||
tags: [Dijkstra, Algorithm, Pathfinding, [[Graph Theory|Graph Theory]]]
|
||||
last_reinforced: 2026-04-20
|
||||
---
|
||||
|
||||
@@ -23,5 +23,5 @@ last_reinforced: 2026-04-20
|
||||
- 데이크스트라는 음수 가중치(음수의 거리 등)가 있는 환경에서는 작동하지 않는다(이땐 벨만-포드 필요). 또한, 거대한 맵에서는 탐색 범위가 너무 넓어지므로, 목표 지점 방향으로 먼저 탐색하는 지능을 더한 `A* (A-Star) 알고리즘`이 실무에서 더 선호된다.
|
||||
|
||||
## 🔗 지식 연결 (Graph)
|
||||
- Related: [[Autonomous-Vehicle-Path-Planning]] , [[Combinatorial-Optimization]]
|
||||
- Foundation: [[Computational Theory & Math/Information Theory]]
|
||||
- Related: [[Autonomous-Vehicle-Path-Planning|Autonomous-Vehicle-Path-Planning]] , [[Combinatorial-Optimization|Combinatorial-Optimization]]
|
||||
- Foundation: Computational Theory & Math/Information Theory
|
||||
|
||||
Reference in New Issue
Block a user