Breadth First Search Approach for Shortest Path Solution in Cartesian Area
| Autor: | Mufida Khairani, Mukhlis Ramadhan, Surya Darma Nasution, Tengku Mohd Diansyah, Muhammad Dahria, Dahlan Abdullah, Badrul Anwar, Saiful Nurarif, Robbi Rahim |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
History
Computer science Breadth-first search Field (mathematics) 0102 computer and information sciences Floyd–Warshall algorithm 01 natural sciences 030218 nuclear medicine & medical imaging Computer Science Applications Education law.invention 03 medical and health sciences 0302 clinical medicine 010201 computation theory & mathematics law Optimal route Shortest path problem Cartesian coordinate system Algorithm |
| Zdroj: | Journal of Physics: Conference Series. 1019:012036 |
| ISSN: | 1742-6596 1742-6588 |
| DOI: | 10.1088/1742-6596/1019/1/012036 |
| Popis: | Determining the shortest path is one problem that is much discussed using some algorithm like Djikstra, Floyd Warshall and in this research an algorithm Breadth First Search are used, Breadth First Search algorithms in this study is used to determine the shortest route and optimal from a Cartesian field, the best and optimal route search experiment of cartesian areas using Breadth First Search algorithm can be perform very well and gets some route options from the best to the longest route. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|