Shahin, RoaaBoğa, RenginSezen, Efe Haşim2024-07-122024-07-122022Shahin, R. (2022). The shortest path problem algorithm. Boğa, R. ve Sezen, A. H. (Ed.). Maltepe Üniversitesi Mimarlık ve Tasarım Uluslararası Öğrenci Kongresi içinde (ss. 26). İstanbul: T.C. Maltepe Üniversitesi.978-605-2124-62-8https://www.maltepe.edu.tr/muisc2022/https://hdl.handle.net/20.500.12415/8870The purpose of this paper is to compare two different techniques for finding the shortest path on maps as artificial intelligence algorithms (Dijkstra's algorithm and the Floyd–Warshall algorithm), explaining the advantages and disadvantages of each. Furthermore, after comparing the algorithms in terms of maze examples using Python codes and some modifications, besides picking up the pros of both algorithms and combining them together to generalize the shortest path between two points in the most efficient and least data-consuming way.eninfo:eu-repo/semantics/openAccessArtificial Intelligence AlgorithmsPython CodesShortest Path on MapsConference Object2626