{"id":18438877,"url":"https://github.com/youseftareq33/java_algorithm_1_optimalstrategy_dynamicprogramming","last_synced_at":"2026-04-30T13:34:22.021Z","repository":{"id":248761921,"uuid":"829636955","full_name":"youseftareq33/Java_Algorithm_1_OptimalStrategy_DynamicProgramming","owner":"youseftareq33","description":"Implementing a Dynamic Programming solution to minimize travel costs","archived":false,"fork":false,"pushed_at":"2024-07-16T20:53:38.000Z","size":1317,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-21T15:55:01.150Z","etag":null,"topics":["algorithm","dynamic-programming","java","javafx"],"latest_commit_sha":null,"homepage":"","language":"Java","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/youseftareq33.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-07-16T20:49:16.000Z","updated_at":"2024-08-07T19:10:03.000Z","dependencies_parsed_at":"2024-07-17T01:07:01.732Z","dependency_job_id":"cd6abc36-f186-4b18-b66f-ea32646cd4ee","html_url":"https://github.com/youseftareq33/Java_Algorithm_1_OptimalStrategy_DynamicProgramming","commit_stats":null,"previous_names":["youseftareq33/java_algorithm_1_optimalstrategy_dynamicprogramming"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/youseftareq33/Java_Algorithm_1_OptimalStrategy_DynamicProgramming","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Algorithm_1_OptimalStrategy_DynamicProgramming","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Algorithm_1_OptimalStrategy_DynamicProgramming/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Algorithm_1_OptimalStrategy_DynamicProgramming/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Algorithm_1_OptimalStrategy_DynamicProgramming/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/youseftareq33","download_url":"https://codeload.github.com/youseftareq33/Java_Algorithm_1_OptimalStrategy_DynamicProgramming/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/youseftareq33%2FJava_Algorithm_1_OptimalStrategy_DynamicProgramming/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32466333,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-30T13:12:12.517Z","status":"ssl_error","status_checked_at":"2026-04-30T13:12:06.837Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithm","dynamic-programming","java","javafx"],"created_at":"2024-11-06T06:22:21.536Z","updated_at":"2026-04-30T13:34:21.993Z","avatar_url":"https://github.com/youseftareq33.png","language":"Java","readme":"# Optimal Strategy for Minimum cost Dynamic Programming\n\n# Description:\ncreating a program to find the minimum cost travel path from City1 to City2 using Dynamic Programming.\nThe program will consider multiple stopovers, varying travel and hotel costs, and aim to minimize the total trip cost.\nThe output includes the optimal path, alternative solutions, and a detailed DP table, presented in a user-friendly interface.\n\n# Note: there is app_photo folder\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyouseftareq33%2Fjava_algorithm_1_optimalstrategy_dynamicprogramming","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyouseftareq33%2Fjava_algorithm_1_optimalstrategy_dynamicprogramming","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyouseftareq33%2Fjava_algorithm_1_optimalstrategy_dynamicprogramming/lists"}