Vaneeza-7/Graph-Optimization-Problem-using-Uninformed-Search

Calculating the minimum cost and optimal path for a graph using bfs, dfs, and ucs in Artificial Intelligence

/ 100

Experimental

No commits in the last 6 months.

Stale 6m No Package No Dependents

Maintenance 0 / 25

Adoption 0 / 25

Maturity 11 / 25

Community 0 / 25

Stars

—

Forks

—

Language

Jupyter Notebook

License

MIT

Category

Last pushed

Jun 25, 2024

Commits (30d)

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Vaneeza-7/Graph-Optimization-Problem-using-Uninformed-Search"

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

algoprog/Laby

Maze generator, editor & solver in Java

FK04/AI_Lab

AI lab implementations covering informed and uninformed search algorithms with classic...

VedantKhairnar/The-Maze-Runner

AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze