An interactive web application that visualizes Breadth-First Search (BFS) and Depth-First Search (DFS) on graphs using smooth animations and a modern dark dashboard UI.
-
Updated
Feb 15, 2026 - JavaScript
#
travesal
Here are 7 public repositories matching this topic...
This Python code employs the Depth-First Search (DFS) algorithm to find a path from "Arad" to "Bucharest" in the Romania map. It uses a priority queue, backtracking, and a graph representation. The DFS path is printed at the end. Skills demonstrated include graph traversal, priority queue usage, and DFS algorithm implementation.
python ai graph project priority-queue python3 artificial-intelligence dfs python-3 searching-algorithms depth-first-search dfs-algorithm searching dfs-search travesal
-
Updated
Aug 28, 2024 - Python
An interactive web application that visualizes Breadth-First Search (BFS) and Depth-First Search (DFS) on graphs using smooth animations and a modern dark dashboard UI.
-
Updated
Feb 15, 2026 - JavaScript
designed to process and combine multiple files within a specified directory into a single output file. This tool is particularly useful for reducing the size of large codebases or collections of text files by removing unnecessary line breaks, comments, etc.
-
Updated
Oct 3, 2024 - Python
Add this topic to your repo
To associate your repository with the travesal topic, visit your repo's landing page and select "manage topics."