{"id":22582741,"url":"https://github.com/ixgnoy/csc4202-project","last_synced_at":"2026-03-19T23:10:52.931Z","repository":{"id":245884218,"uuid":"819463745","full_name":"ixgnoy/CSC4202-Project","owner":"ixgnoy","description":"Algorithm Implementation using Dijkstra algorithm (Greedy Algorithm and Graph Algorithm) (Java)","archived":false,"fork":false,"pushed_at":"2025-02-21T06:51:39.000Z","size":285,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-21T07:31:59.970Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"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/ixgnoy.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-06-24T14:54:43.000Z","updated_at":"2025-02-21T06:52:34.000Z","dependencies_parsed_at":"2024-06-24T16:48:31.593Z","dependency_job_id":"3d988c73-378f-4b81-b320-3664900f275e","html_url":"https://github.com/ixgnoy/CSC4202-Project","commit_stats":null,"previous_names":["ixgnoy/csc4202-project"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ixgnoy%2FCSC4202-Project","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ixgnoy%2FCSC4202-Project/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ixgnoy%2FCSC4202-Project/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ixgnoy%2FCSC4202-Project/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ixgnoy","download_url":"https://codeload.github.com/ixgnoy/CSC4202-Project/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246068280,"owners_count":20718501,"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":[],"created_at":"2024-12-08T06:12:12.707Z","updated_at":"2026-01-06T18:41:29.993Z","avatar_url":"https://github.com/ixgnoy.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🍔 Food Delivery Optimization System\n\n*Java-based algorithmic solution to prioritize food orders and find the most efficient delivery routes.*\n\n![Java](https://img.shields.io/badge/Java-ED8B00?style=for-the-badge\u0026logo=openjdk\u0026logoColor=white)\n![Project Status](https://img.shields.io/badge/status-Completed-brightgreen?style=for-the-badge)\n![Lines of Code](https://img.shields.io/tokei/lines/github/ixgnoy/CSC3402-Project?style=for-the-badge)\n![Last Commit](https://img.shields.io/github/last-commit/ixgnoy/CSC3402-Project?style=for-the-badge)\n![Visitors](https://visitor-badge.laobi.icu/badge?page_id=ixgnoy.CSC3402-Project)\n\n---\n\n## 🗂 Table of Contents\n\n### 📖 Part 1 – Introduction\n- 1.0 Scenario and Problem  \n- 2.0 Importance of Optimal Solution  \n- 3.0 Algorithm Suitability Review  \n\n### 🧠 Part 2 – Algorithm Design\n- 4.0 Model Development of the Scenario  \n  - 4.1 Overview  \n  - 4.2 Delivery Prioritization for Food Orders  \n  - 4.3 Best Travelling Route  \n  - 4.4 Constraints and Challenges  \n- 5.0 Algorithm Design  \n  - 5.1 Overview  \n  - 5.2 Delivery Prioritization for Food Orders  \n  - 5.3 Best Travelling Route  \n  - 5.4 Example  \n- 6.0 Algorithm Specification  \n\n### 💻 Part 3 – Implementation of Algorithm\n- [7.0 Coding](part_3_implementation/7.0-coding)  \n- 7.1 Algorithm Implementations  \n- 7.2 Algorithm Descriptions  \n- 7.3 Demonstration  \n- 7.4 Results  \n- 7.5 Analysis of Algorithms  \n  - 7.5.1 Correctness of the Algorithm  \n  - 7.5.2 Time Complexity Analysis  \n\n---\n\n## 🧰 Tech Stack\n\n- ![Java](https://img.shields.io/badge/Java-ED8B00?style=flat-square\u0026logo=openjdk\u0026logoColor=white)\n- Algorithm Design\n- Problem Solving\n- Time \u0026 Space Complexity Analysis\n\n---\n\n### ✍️ Notes\nThis project focuses on building **an optimal food delivery algorithm** using Java. It simulates order prioritization, route efficiency, and applies time complexity analysis for benchmarking algorithm performance.\n\n---\n\n### 🚀 How to Run\n```bash\njavac FoodDelivery.java\njava FoodDelivery\n```\n\n  ## Table of Contents\n\u003c!DOCTYPE html\u003e\n\u003chtml lang=\"en\"\u003e\n\u003chead\u003e\n  \u003cmeta charset=\"UTF-8\"\u003e\n  \u003cmeta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\"\u003e\n\n\u003c/head\u003e\n\u003cbody\u003e\n  \u003chr\u003e\n  \u003ch2\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_1_introduction/README.md\"\u003ePart 1 – Introduction\u003c/a\u003e\u003c/h2\u003e\n  \u003cul\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_1_introduction/1_Scenario_and_Problem.md\"\u003e1.0 Scenario and Problem\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_1_introduction/2_importance_of_optimal_solution.md\"\u003e2.0 Importance of Optimal Solution\u003c/a\u003e\u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_1_introduction/3_algorithms_suitability_review.md\"\u003e3.0 Algorithm Suitability Review\u003c/a\u003e\u003c/li\u003e\n  \u003c/ul\u003e\n  \u003ch2\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/README.md\"\u003ePart 2 – Algorithm Design\u003c/a\u003e\u003c/h2\u003e\n  \u003cul\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/4_scenario_model_development/README.md\"\u003e4.0 Model Development of the Scenario\u003c/a\u003e\u003c/li\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/4_scenario_model_development/4.1_overview.md\"\u003e4.1 Overview\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/4_scenario_model_development/4.2-delivery-prioritization-for-food-orders.md\"\u003e4.2 Delivery Prioritization for Food Orders\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/4_scenario_model_development/4.3_best_travelling_route.md\"\u003e4.3 Best Travelling Route\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/4_scenario_model_development/4.4_constrain_and_challenges.md\"\u003e4.4 Constraints and Challenges\u003c/a\u003e\u003c/li\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/5_algorithm_design/README.md\"\u003e5.0 Algorithm Design\u003c/a\u003e\u003c/li\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/5_algorithm_design/5.1_overview.md\"\u003e5.1 Overview\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/5_algorithm_design/5.2_delivery_prioritization_for_food_orders.md\"\u003e5.2 Delivery Prioritization for Food Orders\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/5_algorithm_design/5.3_best_travelling_route.md\"\u003e5.3 Best Travelling Route\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_2_algorithm_design/5_algorithm_design/5.4_example.md\"\u003e5.4 Example\u003c/a\u003e\u003c/li\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/tree/main/part_2_algorithm_design/6_Algorithm_Specification\"\u003e6.0 Algorithm Specification\u003c/a\u003e\u003c/li\u003e\n  \u003c/ul\u003e\n  \u003ch2\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/README.md\"\u003ePart 3 – Implementation of Algorithm\u003c/a\u003e\u003c/h2\u003e\n  \u003cul\u003e\n    \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/tree/main/part_3_implementation/7.0-coding\"\u003e7.0 Coding\u003c/a\u003e\u003c/li\u003e\n      \u003cul\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/7.0-coding/7.1-algorithm-implementations.md\"\u003e7.1 Algorithm Implementations\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/7.0-coding/7.2-algorithm-descriptions.md\"\u003e7.2 Algorithm Descriptions\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/7.0-coding/7.3-demonstration.md\"\u003e7.3 Demonstration\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/7.0-coding/7.4-results.md\"\u003e7.4 Results\u003c/a\u003e\u003c/li\u003e\n        \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/tree/main/part_3_implementation/7.0-coding/7.5-analysis-of-algorithm\"\u003e7.5 Analysis of Algorithms\u003c/a\u003e\u003c/li\u003e\n        \u003cul\u003e\n          \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/7.0-coding/7.5-analysis-of-algorithm/7.5.1-correctness-of-the-algorithm.md\"\u003e7.5.1 Correctness of the Algorithm\u003c/a\u003e\u003c/li\u003e\n          \u003cli\u003e\u003ca href=\"https://github.com/ixgnoy/CSC4202-Project/blob/main/part_3_implementation/7.0-coding/7.5-analysis-of-algorithm/7.5.2-time-complexity-analysis.md\"\u003e7.5.2 Time Complexity Analysis\u003c/a\u003e\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/ul\u003e\n    \u003c/li\u003e\n\u003c/body\u003e\n\u003c/html\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fixgnoy%2Fcsc4202-project","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fixgnoy%2Fcsc4202-project","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fixgnoy%2Fcsc4202-project/lists"}