{"id":19413713,"url":"https://github.com/vaneeza-7/graph-optimization-problem-using-uninformed-search","last_synced_at":"2025-02-25T02:46:00.414Z","repository":{"id":245501525,"uuid":"764807124","full_name":"Vaneeza-7/Graph-Optimization-Problem-using-Uninformed-Search","owner":"Vaneeza-7","description":"Calculating the minimum cost and optimal path for a graph using bfs, dfs, and ucs in Artificial Intelligence","archived":false,"fork":false,"pushed_at":"2024-06-25T19:42:51.000Z","size":152,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-07T15:44:33.691Z","etag":null,"topics":["artificial-intelligence","artificial-intelligence-algorithms","bfs","dfs","graph","minimum-cost","networkx","optimal-path","ucs"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Vaneeza-7.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-02-28T18:42:33.000Z","updated_at":"2024-06-25T19:42:54.000Z","dependencies_parsed_at":"2024-11-10T12:35:42.045Z","dependency_job_id":"90ba4bda-b604-4066-92d0-7d01e39ae689","html_url":"https://github.com/Vaneeza-7/Graph-Optimization-Problem-using-Uninformed-Search","commit_stats":null,"previous_names":["vaneeza-7/graph-optimization-problem-using-uninformed-search"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FGraph-Optimization-Problem-using-Uninformed-Search","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FGraph-Optimization-Problem-using-Uninformed-Search/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FGraph-Optimization-Problem-using-Uninformed-Search/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vaneeza-7%2FGraph-Optimization-Problem-using-Uninformed-Search/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vaneeza-7","download_url":"https://codeload.github.com/Vaneeza-7/Graph-Optimization-Problem-using-Uninformed-Search/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240593150,"owners_count":19825930,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["artificial-intelligence","artificial-intelligence-algorithms","bfs","dfs","graph","minimum-cost","networkx","optimal-path","ucs"],"created_at":"2024-11-10T12:34:41.054Z","updated_at":"2025-02-25T02:46:00.386Z","avatar_url":"https://github.com/Vaneeza-7.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph Optimized Path Finding\n\nCalculating the minimum cost and optimal path for a graph using BFS, DFS, and UCS in Artificial Intelligence.\n\nAssignment @ Artificial Intelligence\n\n## Algorithms\n\n- **Breadth-First Search (BFS)**: Explores all possible paths level by level, ensuring the shortest path in an unweighted graph.\n- **Depth-First Search (DFS)**: Explores paths by going as deep as possible, useful for exploring all possible paths in a graph.\n- **Uniform Cost Search (UCS)**: Finds the least cost path in a weighted graph, expanding the least cost node first.\n\n## License\n\nThis project is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvaneeza-7%2Fgraph-optimization-problem-using-uninformed-search","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvaneeza-7%2Fgraph-optimization-problem-using-uninformed-search","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvaneeza-7%2Fgraph-optimization-problem-using-uninformed-search/lists"}