Depth-First Search (DFS: Useful for cycle detection, topological sort, and maze-solving) and Breadth-First Search (BFS: Good for shortest path in unweighted graphs) implementation with python.
-
Updated
Jul 9, 2025 - Python
#
graph-traversal-algorithms
Here are 5 public repositories matching this topic...
A visualizer for graph traversal algorithms such as Breadth First Search, Depth First Search, A* Search, etc. developed using HTML, CSS, JavaScript, and Python.
-
Updated
Jul 1, 2020 - Python
Indoor navigation app using Android and Bluetooth low energy Beacons to correctly locate and track a user and help the user navigate in the lowest time possible. We utilize RSSI for trilateration
-
Updated
Oct 11, 2023 - Python
Project for solving "Chameleon problem" (also getting some experience in Python and graph traversing algorithms)
-
Updated
Dec 24, 2018 - Python
Implementation and a visual demonstration of A* search algorithm using pygame and Tkinter for GUI.
pathfinding pygame pathfinder search-algorithm pathfinding-algorithm graph-traversal a-star-algorithm graph-traversal-algorithms a-star-search python-gui-tkinter a-star-path-finding
-
Updated
May 29, 2020 - Python
Improve this page
Add a description, image, and links to the graph-traversal-algorithms topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the graph-traversal-algorithms topic, visit your repo's landing page and select "manage topics."