Year: 2025
Type: article
Abstract: Breadth-First Search (BFS) is a method to explore or search through graphs step by step.In this task, the BFS is used to find the shortest path from source to destination.In the present paper the workflow of BFS is presented node by node by moving level by level and checking all nearby rooms before going deeper.In the present work the time and memory consumed is analyzed during the graph traversing by BFS.The queue is considered to track the search nodes and find the best path.Along the way, also returned which rooms were checked, which paths were avoided, and how BFS helps in finding the shortest route.Finally, the shortest route is identified and calculated the path cost.
Authors: T. Sneha, B. Pavithra, N. Vaishnavi, K. Lohith, N. Suresh Kumar
Institution: GITAM University
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4409840830