{"id":23062124,"url":"https://github.com/mahmood-anaam/deterministic-dynamic-programming","last_synced_at":"2026-05-09T04:32:41.212Z","repository":{"id":252320725,"uuid":"840087238","full_name":"Mahmood-Anaam/deterministic-dynamic-programming","owner":"Mahmood-Anaam","description":"This repository explores deterministic dynamic programming solutions for the Shortest Path Problem (SPP) and the Traveling Salesperson Problem (TSP). It includes graphical representations, a detailed Jupyter notebook, and practical implementations for optimizing travel routes and minimizing costs in various city-based scenarios.","archived":false,"fork":false,"pushed_at":"2024-08-10T01:48:20.000Z","size":99,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-03T07:23:57.240Z","etag":null,"topics":["dynamic-programming","graph-theory","jupyter-notebook","numpy","python","shortest-path-problem","traveling-salesperson-problem"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","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/Mahmood-Anaam.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-08-09T00:18:37.000Z","updated_at":"2024-08-10T01:48:23.000Z","dependencies_parsed_at":"2024-12-16T03:20:08.856Z","dependency_job_id":"b10fd559-5893-4b5e-978b-ccf19f5fc6bd","html_url":"https://github.com/Mahmood-Anaam/deterministic-dynamic-programming","commit_stats":null,"previous_names":["mahmood-anaam/deterministic-dynamic-programming"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Mahmood-Anaam/deterministic-dynamic-programming","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mahmood-Anaam%2Fdeterministic-dynamic-programming","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mahmood-Anaam%2Fdeterministic-dynamic-programming/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mahmood-Anaam%2Fdeterministic-dynamic-programming/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mahmood-Anaam%2Fdeterministic-dynamic-programming/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Mahmood-Anaam","download_url":"https://codeload.github.com/Mahmood-Anaam/deterministic-dynamic-programming/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mahmood-Anaam%2Fdeterministic-dynamic-programming/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32807209,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-08T08:22:46.396Z","status":"online","status_checked_at":"2026-05-09T02:00:06.633Z","response_time":123,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["dynamic-programming","graph-theory","jupyter-notebook","numpy","python","shortest-path-problem","traveling-salesperson-problem"],"created_at":"2024-12-16T03:20:00.785Z","updated_at":"2026-05-09T04:32:41.198Z","avatar_url":"https://github.com/Mahmood-Anaam.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Shortest Path \u0026 Traveling Salesperson Problems\n## Deterministic Dynamic Programming\n\n## Overview\n\nThis project explores solutions to the Shortest Path Problem (SPP) and the Traveling Salesperson Problem (TSP) using deterministic dynamic programming. It involves finding the shortest path between cities with specified energy costs and determining the optimal sequence for visiting multiple cities in TSP scenarios.\n\n## Code Structure\n\n```markdown\ndeterministic-dynamic-programming/\n│\n├── README.md                                          # overview and instructions\n├── Practical_Deterministic_Dynamic_Programming.ipynb  # Jupyter notebook for solving SPP and TSP with detailed explanations\n├── graph_shortest_path_problem.png                    # Graphical representation of the Shortest Path Problem\n├── graph_traveling_salesperson_problem.png            # Graphical representation of the Traveling Salesperson Problem\n\n```\n\n\n## Usage\n\n1. **Open the Notebook:**\n   - Run the Jupyter notebook to explore the deterministic dynamic programming solution for both SPP and TSP:\n     ```bash\n     jupyter notebook Practical_Deterministic_Dynamic_Programming.ipynb\n     ```\n\n2. **View Graphs:**\n   - The images `graph_shortest_path_problem.png` and `graph_traveling_salesperson_problem.png` illustrate the SPP and TSP respectively.\n  \n\u003c/br\u003e\n\n\u003cimg src=\"graph_shortest_path_problem.png\" alt=\"graph shortest path problem\"\u003e\n\n\u003c/br\u003e\n\n\u003cimg src=\"graph_traveling_salesperson_problem.png\" alt=\"graph traveling salesperson problem\" /\u003e\n\n\n\n## Key Concepts\n\n- **Deterministic Dynamic Programming:** Used to calculate the least-cost paths in both the SPP and TSP scenarios.\n- **Optimization of Travel Routes:** Applied to minimize the total energy cost or distance traveled across cities.\n\n\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmahmood-anaam%2Fdeterministic-dynamic-programming","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmahmood-anaam%2Fdeterministic-dynamic-programming","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmahmood-anaam%2Fdeterministic-dynamic-programming/lists"}