{"id":25293835,"url":"https://github.com/srujayreddy/path-finder","last_synced_at":"2025-07-19T20:35:12.472Z","repository":{"id":273025309,"uuid":"918499644","full_name":"SrujayReddy/Path-Finder","owner":"SrujayReddy","description":"Java-based application for finding shortest walking paths around the UW–Madison campus.","archived":false,"fork":false,"pushed_at":"2025-01-26T07:02:34.000Z","size":39,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-13T01:55:34.545Z","etag":null,"topics":["campus-navigation","cli-application","dijkstras-algorithm","graph-data-structures","hash-table","maps","shortest-path"],"latest_commit_sha":null,"homepage":"","language":"Java","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/SrujayReddy.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":"2025-01-18T04:52:27.000Z","updated_at":"2025-01-26T07:02:37.000Z","dependencies_parsed_at":"2025-01-18T05:29:14.280Z","dependency_job_id":"c2374db1-809c-469a-bb78-bb83b3291f8a","html_url":"https://github.com/SrujayReddy/Path-Finder","commit_stats":null,"previous_names":["srujayreddy/path-finder"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SrujayReddy%2FPath-Finder","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SrujayReddy%2FPath-Finder/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SrujayReddy%2FPath-Finder/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SrujayReddy%2FPath-Finder/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SrujayReddy","download_url":"https://codeload.github.com/SrujayReddy/Path-Finder/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247543601,"owners_count":20955865,"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":["campus-navigation","cli-application","dijkstras-algorithm","graph-data-structures","hash-table","maps","shortest-path"],"created_at":"2025-02-13T01:55:37.592Z","updated_at":"2025-04-06T19:55:00.514Z","avatar_url":"https://github.com/SrujayReddy.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n# Path Finder\n\n**Path Finder** is a Java-based application for finding shortest walking paths around the UW–Madison campus. It uses a graph-based approach (with **Dijkstra’s Algorithm**) for computing optimal routes, backed by a custom hashtable that stores map data efficiently.\n\n---\n\n## Table of Contents\n\n1. [Project Overview](#project-overview)  \n2. [Features](#features)  \n3. [Technologies \u0026 Tools](#technologies--tools)  \n4. [Setup \u0026 Installation](#setup--installation)  \n5. [Usage](#usage)  \n6. [Testing](#testing)  \n7. [Project Structure](#project-structure)  \n8. [Contributors](#contributors)  \n9. [License](#license)  \n\n---\n\n## Project Overview\n\nThis project allows users to:\n- Load campus map data and display building information.\n- Compute and display the shortest path between two buildings.\n- Show total walking time and route details using a text-based user interface.\n\nIt includes a separate frontend and backend, ensuring a modular structure for user interaction vs. data processing. A custom-chained **HashtableMap** and a **DijkstraGraph** class support efficient lookups and shortest path calculations.\n\n---\n\n## Features\n\n- **Campus Data Management**: Load building and path data (e.g., from `campus.dot`) into a graph.  \n- **Shortest Path Calculation**: Uses Dijkstra’s Algorithm to quickly compute walking routes around campus.  \n- **Frontend \u0026 Backend Separation**: Clear distinction between the user interface (`Frontend`) and core logic (`Backend`).  \n- **Extensive Testing**: Includes multiple JUnit-based test suites for both frontend and backend functionalities.\n\n---\n\n## Technologies \u0026 Tools\n\n- **Java (11+)**  \n- **JUnit 5** for testing  \n- **Makefile** for compiling and running tests  \n- **Graph Data** (e.g., `.dot` files) for campus paths  \n- **Git** for version control  \n\n---\n\n## Setup \u0026 Installation\n\n1. **Clone the repository**:\n```bash\ngit clone https://github.com/SrujayReddy/Path-Finder.git\ncd Path-Finder\n\n```\n\n2.  **Ensure Java 11+** is installed.  \n    If you plan to run tests locally, confirm you have `junit5.jar` accessible on your machine (or set up in your IDE).\n    \n3.  **Review the files** to confirm you see `.java` sources, `Makefile`, and data files like `campus.dot`.\n    \n       \n\n----------\n\n## Usage\n\nYou can compile and run using the **Makefile** or standard `javac`/`java` commands.\n\n-   **Compile \u0026 run the application**:\n\n```bash\nmake run\n\n```\n\nThis compiles `Frontend.java` (and necessary classes) and runs it.\n\nAlternatively, compile manually:\n\n```bash\njavac Frontend.java\njava Frontend\n\n```\n\n_(Adjust the main class if needed; some groups may start in `Backend.java`.)_\n\n----------\n\n## Testing\n\nWe have two main sets of tests: **`BackendDeveloperTests`** and **`FrontendTests`**.\n\n-   **Backend Tests**:\n\n```bash\nmake runBDTests\n\n```\n\nCompiles and runs all JUnit 5 tests for the backend.\n\n-   **Frontend Tests**:\n\n```bash\nmake runFDTests\n\n```\n\nCompiles and runs all JUnit 5 tests for the frontend.\n\n----------\n\n## Project Structure\n\n```\npath-finder/\n├── backend/\n│   ├── Backend.java\n│   ├── BackendDeveloperTests.java\n│   ├── BackendInterface.java\n│   ├── BackendPlaceholder.java\n│   ├── ShortestPathImplementation.java\n│   └── ShortestPathInterface.java\n├── frontend/\n│   ├── Frontend.java\n│   ├── FrontendDeveloperTests.java\n│   ├── FrontendInterface.java\n│   └── TextUITester.java\n├── graph/\n│   ├── BaseGraph.java\n│   ├── DijkstraGraph.java\n│   ├── GraphADT.java\n├── datastructures/\n│   ├── HashtableMap.java\n│   ├── MapADT.java\n│   └── PlaceholderMap.java\n├── submission-checkers/\n│   ├── P23SubmissionChecker.java\n│   └── P25SubmissionChecker.java\n├── server/\n│   └── HelloWebServer.java\n├── data/\n│   └── campus.dot\n└── README.md\n\n```\n\n-   **`campus.dot`** is a sample graph data file with building and path info.\n-   **`PlaceholderMap.java`** was used as a stub during development.\n-   **`TextUITester.java`** helps simulate CLI input/output for test scenarios.\n\n----------\n\n## Contributors\n\n-   **Frontend Developer**: _Srujay Reddy Jakkidi_\n-   **Backend Developer**: _Steve Hu_\n\n----------\n\n## License\n\nThis project was developed as part of **CS400** at the University of Wisconsin–Madison and is shared strictly for educational purposes.\n\n**Important Notes:**\n\n-   Redistribution or reuse of this code for academic submissions is prohibited and may violate academic integrity policies.\n-   For external usage outside the course context, please include a clear reference or attribution.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsrujayreddy%2Fpath-finder","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsrujayreddy%2Fpath-finder","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsrujayreddy%2Fpath-finder/lists"}