{"id":30715440,"url":"https://github.com/yothgewalt/single-source-shortest-paths","last_synced_at":"2025-09-03T06:08:40.817Z","repository":{"id":312531506,"uuid":"1043625878","full_name":"yothgewalt/single-source-shortest-paths","owner":"yothgewalt","description":"This repository implements Single Source Shortest Paths (SSSP) algorithms in Go.","archived":false,"fork":false,"pushed_at":"2025-08-24T09:14:33.000Z","size":4,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-08-31T10:58:48.382Z","etag":null,"topics":["algorithm","go","graph","sssp"],"latest_commit_sha":null,"homepage":"https://arxiv.org/pdf/2504.17033","language":"Go","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/yothgewalt.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-08-24T09:14:08.000Z","updated_at":"2025-08-24T09:52:37.000Z","dependencies_parsed_at":"2025-08-31T10:58:49.809Z","dependency_job_id":"9d5cfc59-1607-459c-aa0e-f7667466a2c7","html_url":"https://github.com/yothgewalt/single-source-shortest-paths","commit_stats":null,"previous_names":["yothgewalt/single-source-shortest-paths"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/yothgewalt/single-source-shortest-paths","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yothgewalt%2Fsingle-source-shortest-paths","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yothgewalt%2Fsingle-source-shortest-paths/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yothgewalt%2Fsingle-source-shortest-paths/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yothgewalt%2Fsingle-source-shortest-paths/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yothgewalt","download_url":"https://codeload.github.com/yothgewalt/single-source-shortest-paths/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yothgewalt%2Fsingle-source-shortest-paths/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273398153,"owners_count":25098310,"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-09-03T02:00:09.631Z","response_time":76,"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":["algorithm","go","graph","sssp"],"created_at":"2025-09-03T06:08:38.000Z","updated_at":"2025-09-03T06:08:40.806Z","avatar_url":"https://github.com/yothgewalt.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Single Source Shortest Paths (SSSP) Algorithm\n\nThis repository implements Single Source Shortest Paths (SSSP) algorithms in Go. SSSP algorithms find the shortest paths from a given source vertex to all other vertices in a weighted graph.\n\n## Features\n- Graph data structure implementation\n- Priority queue for efficient shortest path computation\n- SSSP algorithm (e.g., Dijkstra's algorithm)\n- Example usage in `main.go`\n\n## File Structure\n- `graph.go`: Graph representation and related methods\n- `priority_queue.go`: Priority queue implementation\n- `single_source_shortest_paths.go`: SSSP algorithm implementation\n- `data_structure.go`: Supporting data structures\n- `main.go`: Entry point and example usage\n- `go.mod`: Go module definition\n\n## Usage\n1. **Clone the repository:**\n   ```zsh\n   git clone github.com/yothgewalt/single-source-shortest-paths.git\n   cd single-source-shortest-paths\n   ```\n2. **Run the example:**\n   ```zsh\n   go run main.go\n   ```\n\n## Example\nBelow is a simple example of how to use the SSSP algorithm:\n```go\n// ...existing code...\nsource := 0\nshortestPaths := SSSP(graph, source)\nfmt.Println(\"Shortest paths from source:\", shortestPaths)\n// ...existing code...\n```\n\n## Algorithms Implemented\n- Dijkstra's Algorithm (for graphs with non-negative weights)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyothgewalt%2Fsingle-source-shortest-paths","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyothgewalt%2Fsingle-source-shortest-paths","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyothgewalt%2Fsingle-source-shortest-paths/lists"}