D

DFS Searching Algorithm

Project information

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 python-3 python3 project AI artificial i... artificial-i... dfs Depth-first ... searching-al... traverse priority queue graph traversal searching

21 Commits
1 Branch
0 Tags

README

Created on

August 02, 2024

Loading