z-logo
open-access-imgOpen Access
Breadth First Search Approach for Shortest Path Solution in Cartesian Area
Author(s) -
Robbi Rahim,
Dahlan Abdullah,
Saiful Nurarif,
Mukhlis Ramadhan,
Badrul Anwar,
Muhammad Dahria,
Surya Darma Nasution,
Tengku Mohd Diansyah,
Mufida Khairani
Publication year - 2018
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1019/1/012036
Subject(s) - shortest path problem , cartesian coordinate system , path (computing) , search algorithm , yen's algorithm , computer science , breadth first search , k shortest path routing , pathfinding , depth first search , algorithm , constrained shortest path first , shortest path faster algorithm , mathematical optimization , best first search , mathematics , theoretical computer science , dijkstra's algorithm , beam search , graph , geometry , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here