GitHub / 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
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FGraph-Optimization-Problem-using-Uninformed-Search
PURL: pkg:github/Vaneeza-7/Graph-Optimization-Problem-using-Uninformed-Search
Stars: 0
Forks: 0
Open issues: 0
License: mit
Language: Jupyter Notebook
Size: 148 KB
Dependencies parsed at: Pending
Created at: over 1 year ago
Updated at: about 1 year ago
Pushed at: about 1 year ago
Last synced at: 5 months ago
Topics: artificial-intelligence, artificial-intelligence-algorithms, bfs, dfs, graph, minimum-cost, networkx, optimal-path, ucs