GitHub / jaiswalchitransh / DFS-Searching-Algorithm
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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FDFS-Searching-Algorithm
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 204 KB
Dependencies parsed at: Pending
Created at: over 1 year ago
Updated at: 3 months ago
Pushed at: 9 months ago
Last synced at: about 2 months ago
Topics: ai, artificial-intelligence, depth-first-search, dfs, dfs-algorithm, dfs-search, graph, priority-queue, project, python, python-3, python3, searching, searching-algorithms, travesal