GitHub - Arzzzzy/Breadth-First-Search-ConnectingFlight: I 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.

Arzzzzy / Breadth-First-Search-ConnectingFlight Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

I 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.

arzzzzy.github.io/breadth-first-search-connectingflight/