The shortest path problem algorithm

Basit Öğe Kaydı
dc.contributor.authorShahin, Roaa
dc.contributor.editorBoğa, Rengin
dc.contributor.editorSezen, Efe Haşim
dc.date.accessioned2024-07-12T21:59:02Z
dc.date.available2024-07-12T21:59:02Z
dc.date.issued2022en_US
dc.departmentMaltepe Üniversitesi, Rektörlüken_US
dc.description.abstractThe 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.en_US
dc.identifier.citationShahin, 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.en_US
dc.identifier.endpage26en_US
dc.identifier.isbn978-605-2124-62-8
dc.identifier.startpage26en_US
dc.identifier.urihttps://www.maltepe.edu.tr/muisc2022/
dc.identifier.urihttps://hdl.handle.net/20.500.12415/8870
dc.language.isoenen_US
dc.publisherT.C. Maltepe Üniversitesien_US
dc.relation.ispartofMaltepe Üniversitesi Mimarlık ve Tasarım Uluslararası Öğrenci Kongresien_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.snmzKY08322
dc.subjectArtificial Intelligence Algorithmsen_US
dc.subjectPython Codesen_US
dc.subjectShortest Path on Mapsen_US
dc.titleThe shortest path problem algorithmen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

Rektörlük-Maltepe Üniversitesi Dergileri Koleksiyonu