arzzzzy / breadth-first-search-connectingflight Goto Github PK
View Code? Open in Web Editor NEWI created a Breadth-First Search (BFS) algorithm for map traversal. The BFS algorithm used to explore all the vertices and edges in a graph efficiently. In this specific implementation, I have adapted BFS for map-like structures, where each location is represented as a node, and paths between locations are considered as edges.
Home Page: https://arzzzzy.github.io/Breadth-First-Search-ConnectingFlight/