Data, information and code regarding the 3 hour run of my Python program on the International Space Station.
-
Updated
Apr 15, 2022 - Python
Data, information and code regarding the 3 hour run of my Python program on the International Space Station.
Live flight tracking
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.
Add a description, image, and links to the flightpath topic page so that developers can more easily learn about it.
To associate your repository with the flightpath topic, visit your repo's landing page and select "manage topics."