{"id":18361263,"url":"https://github.com/jaiswalchitransh/dfs-searching-algorithm","last_synced_at":"2025-04-10T04:24:53.976Z","repository":{"id":220392058,"uuid":"751526873","full_name":"jaiswalchitransh/DFS-Searching-Algorithm","owner":"jaiswalchitransh","description":"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.","archived":false,"fork":false,"pushed_at":"2024-08-28T20:40:19.000Z","size":209,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-15T18:55:42.783Z","etag":null,"topics":["ai","artificial-intelligence","depth-first-search","dfs","dfs-algorithm","dfs-search","graph","priority-queue","project","python","python-3","python3","searching","searching-algorithms","travesal"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/jaiswalchitransh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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-01T19:31:09.000Z","updated_at":"2024-08-28T20:40:22.000Z","dependencies_parsed_at":"2024-02-06T19:25:36.317Z","dependency_job_id":"591e769c-03ff-4ac2-80b1-dddef088db5a","html_url":"https://github.com/jaiswalchitransh/DFS-Searching-Algorithm","commit_stats":null,"previous_names":["chitranshjaiswalgit/dfs-searching-algorithm","jaiswalchitransh/dfs-searching-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FDFS-Searching-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FDFS-Searching-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FDFS-Searching-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaiswalchitransh%2FDFS-Searching-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jaiswalchitransh","download_url":"https://codeload.github.com/jaiswalchitransh/DFS-Searching-Algorithm/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248156056,"owners_count":21056760,"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":["ai","artificial-intelligence","depth-first-search","dfs","dfs-algorithm","dfs-search","graph","priority-queue","project","python","python-3","python3","searching","searching-algorithms","travesal"],"created_at":"2024-11-05T22:32:58.470Z","updated_at":"2025-04-10T04:24:53.960Z","avatar_url":"https://github.com/jaiswalchitransh.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DFS Searching Algorithm\n\n## Table of Contents\n- [Project Overview](#project-overview)\n- [Installation](#installation)\n- [Usage](#usage)\n- [Features](#features)\n- [Contribution](#contribution)\n\n\n## Project Overview\nThe Python code implements a depth-first search (DFS) algorithm to find a path from the city of Arad to Bucharest in Romania. The DFS algorithm is implemented using a priority queue and a dictionary to keep track of nodes and their respective costs. The code begins by initializing a global variable `global_node_id` to keep track of node IDs. The function `get_next_node_id()` increments this global variable whenever a new node is encountered.\n\n\n## Installation\nThis project requires Python 3.12.1 or later.\nTo set up the project:\n1. Ensure Python 3.12.1 or a later version is installed on your system. You can download Python from [python.org](https://www.python.org/downloads/).\n2. Clone or download the repository to your local machine.\n   \n            git clone https://github.com/jaiswalchitransh/DFS-Searching-Algorithm.git\n        \n3. Open the project in your preferred Python environment (e.g., IDE or terminal).\n4. Run the script (`dfs_searching_algo.py`) and observe the output.\n\n\n## Usage\nRun the script:\n\n            python dfs_searching_algo.py\n  \nThis executes the DFS algorithm to find a path from Arad to Bucharest in the Romania map graph.\n\n\n## Features\n- **Implementation**: Implements DFS using a priority queue for efficient pathfinding.\n- **Output**: Outputs the path from Arad to Bucharest.\n- **Demonstration**: Demonstrates dictionary usage for node management and cost calculation.\n\n\n## Contribution\nI, **[Chitransh Jaiswal](https://www.linkedin.com/in/jaiswalchitransh/)** developed this Project Individually. I was responsible for all aspects of the project, including design, development, testing, and documentation.\nContributions to improve the efficiency, readability, or functionality of the code are welcome. To contribute:\n1. Fork the repository.\n2. Create a new branch (`git checkout -b feature/your-feature`).\n3. Make your changes.\n4. Commit your changes (`git commit -am 'Add some feature'`).\n5. Push to the branch (`git push origin feature/your-feature`).\n6. Create a new Pull Request.\n\nPlease ensure your contributions adhere to the coding standards and follow the existing style and structure.\n\n---\n\nThank you for your interest in the DFS Searching Algorithm!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaiswalchitransh%2Fdfs-searching-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaiswalchitransh%2Fdfs-searching-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaiswalchitransh%2Fdfs-searching-algorithm/lists"}