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.
No commits in the last 6 months.
Stars
3
Forks
—
Language
Python
License
—
Last pushed
Aug 28, 2024
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/jaiswalchitransh/DFS-Searching-Algorithm"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
forestagostinelli/deepxube
Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.
misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
algoprog/Laby
Maze generator, editor & solver in Java
tekian/path-finder
Visualization tool to demonstrate how different search algorithms work.