Pathfinding (Swedish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Pathfinding" in Swedish language version.

Last modified: 06:11:27, 22 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank Swedish rank

2^nd place

16^th place

6^th place

108^th place

37^th place

40^th place

low place

low place

low place

archive.org (Global: 6^th place; Swedish: 108^th place)

E. W. Dijkstra (1959). ”A note on two problems in connexion with graphs” (på engelska). Numerische Mathematik 1 (1): sid. 269–271. doi:10.1007/BF01386390. https://archive.org/details/sim_numerische-mathematik_1959_1/page/269. Läst 18 april 2026.
Daniel Delling; Peter Sanders; Dominik Schultes; Dorothea Wagner (2009). ”Engineering route planning algorithms” (på engelska). Algorithmics of Large and Complex Networks. Springer. sid. 117–139. doi:10.1007/978-3-642-02094-0_7. Läst 18 april 2026
Nuria Pelechano; Carlos Fuentes (2016). ”Hierarchical path-finding for Navigation Meshes (HNA*)” (på engelska). Computers & Graphics 59: sid. 68–78. doi:10.1016/j.cag.2016.05.023. https://upcommons.upc.edu/server/api/core/bitstreams/e3842908-9c57-448e-9e5a-993818231cb0/content. Läst 18 april 2026.

Wolfgang Hönig; Jiaoyang Li; Sven Koenig (2020). ”Overview of Multi-Agent Path Finding” (på engelska). Model AI Assignments. https://idm-lab.org/project-p/material/overview.pdf. Läst 18 april 2026.