{"id":25633788,"url":"https://github.com/t-lak/graphworks","last_synced_at":"2025-07-26T09:08:10.240Z","repository":{"id":154884879,"uuid":"410604863","full_name":"T-Lak/GraphWorks","owner":"T-Lak","description":"Java implementation of some graph algorithms (Fleury, Kruskal, Prim, Hierholzer \u0026 Breadth-First Search).","archived":false,"fork":false,"pushed_at":"2025-02-04T23:15:52.000Z","size":43,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-22T22:29:43.813Z","etag":null,"topics":["breadth-first-search","eulerian-path","fleury","graph-algorithms","graph-stream","hierholzer","java","kruskal-algorithm","minimal-spanning-tree","prim-algorithm","shortest-path","shortest-path-algorithm"],"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/T-Lak.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}},"created_at":"2021-09-26T16:34:07.000Z","updated_at":"2025-02-04T23:24:13.000Z","dependencies_parsed_at":"2023-09-24T05:13:40.809Z","dependency_job_id":null,"html_url":"https://github.com/T-Lak/GraphWorks","commit_stats":null,"previous_names":["t-lak/graph-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/T-Lak/GraphWorks","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Lak%2FGraphWorks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Lak%2FGraphWorks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Lak%2FGraphWorks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Lak%2FGraphWorks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/T-Lak","download_url":"https://codeload.github.com/T-Lak/GraphWorks/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/T-Lak%2FGraphWorks/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267144502,"owners_count":24042635,"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","status":"online","status_checked_at":"2025-07-26T02:00:08.937Z","response_time":62,"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":["breadth-first-search","eulerian-path","fleury","graph-algorithms","graph-stream","hierholzer","java","kruskal-algorithm","minimal-spanning-tree","prim-algorithm","shortest-path","shortest-path-algorithm"],"created_at":"2025-02-22T22:29:45.502Z","updated_at":"2025-07-26T09:08:09.965Z","avatar_url":"https://github.com/T-Lak.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🌐 GraphWorks \n\n## Overview\nThis project implements several fundamental graph algorithms, organized into three categories:\n\n1. **Shortest Path:**  \n  Find the shortest path between two nodes in a graph using **`Breadth-First Search (BFS)`**.\n2. **Minimum Spanning Tree:**  \n  Compute the minimal spanning tree of a graph using **`Kruskal's`** and **`Prim's`** algorithms.\n3. **Eulerian Path:**  \n  Determine a Eulerian path in a graph using **`Fleury's Algorithm`** and **`Hierholzer's Algorithm`**.  \n  \nAdditionally, this project allows for graph generation through two methods:  \n1. **File-based input:** Load graphs from a file.\n2. **Random graph generation:** Generate graphs of various sizes for testing and illustration purposes.\n  \nGraphs can be visualized for better understanding and analysis using the built-in display functionality.\n  \n## Technologies Used\nThis project relies on the following libraries:\n- **algs4.jar** - A collection of algorithms from [Princeton's Algorithms, Part I course](https://algs4.cs.princeton.edu/home/).\n- **GraphStream (version 2.0)** - For graph visualization, utilizing core, algorithm, and UI components.\n- **JUnit 4.13.1** - For unit testing and ensuring code reliability.\n  \n## Setup Instructions \nTo set up the project:\n1. Download the required libraries:  \n    - **algs4.jar:** [Download Link](https://algs4.cs.princeton.edu/home/)\n    - **GraphStream 2.0:** [GraphStream Website](https://graphstream-project.org/)\n    - **JUnit 4.13.1:** Available via [Maven Central](https://mvnrepository.com/artifact/junit/junit/4.13.2).\n2. Add the libraries to your project’s classpath.\n3. You should now be ready to run the algorithms and generate or load graphs for visualization and analysis.\n  \n## Example Usage\n- You can either **load a graph from a file** or **generate a random graph of your choice**.\n- Use the provided graph visualization tools to display and analyze the structure of the graph.\n  \n## License\nThis project is licensed under the MIT License.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ft-lak%2Fgraphworks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ft-lak%2Fgraphworks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ft-lak%2Fgraphworks/lists"}