Breadth First Search Approach for Shortest-Path Solution in Cartesian Area

Abstract

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.