Reference index / 타일맵·절차 생성·탐색
Dijkstra Algorithm
An algorithm finding shortest paths in graphs with nonnegative edge costs.
When to use it
Automating repeated construction and route checks in 2D maps, dungeons, and generated worlds.
Caveats and distinctions
Validate connectivity, start points, exits, essential resources, and impossible arrangements in generated results.
Implementation and classification
맵·레벨 디자인 / 타일맵·절차 생성·탐색
Sources and verification status
https://doc.mapeditor.org/en/stable/manual/introduction/
Source scope and verification status describe the existing catalog record. Publishing this page does not independently re-verify the latest library version, license, or production behavior.