{"id":17821403,"url":"https://github.com/anthonymazzie/bellmanford","last_synced_at":"2025-06-30T16:39:11.919Z","repository":{"id":206737084,"uuid":"577434106","full_name":"AnthonyMazzie/BellmanFord","owner":"AnthonyMazzie","description":"Given a directed, weighted graph containing positive and negative edge weights, a source node and destination node, this Java application utilizes the Bellman Ford algorithm to return the shortest path and distance from source to destination.","archived":false,"fork":false,"pushed_at":"2022-12-12T18:29:16.000Z","size":161,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-21T10:06:12.092Z","etag":null,"topics":["algorithm","bellman-ford","computer-science","graph"],"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/AnthonyMazzie.png","metadata":{"files":{"readme":null,"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":"2022-12-12T18:20:18.000Z","updated_at":"2024-01-15T19:48:00.000Z","dependencies_parsed_at":"2023-11-12T00:20:20.080Z","dependency_job_id":null,"html_url":"https://github.com/AnthonyMazzie/BellmanFord","commit_stats":null,"previous_names":["anthonymazzie/bellmanford"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AnthonyMazzie/BellmanFord","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnthonyMazzie%2FBellmanFord","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnthonyMazzie%2FBellmanFord/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnthonyMazzie%2FBellmanFord/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnthonyMazzie%2FBellmanFord/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AnthonyMazzie","download_url":"https://codeload.github.com/AnthonyMazzie/BellmanFord/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnthonyMazzie%2FBellmanFord/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261103434,"owners_count":23109930,"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":["algorithm","bellman-ford","computer-science","graph"],"created_at":"2024-10-27T17:17:17.957Z","updated_at":"2025-06-21T10:06:27.411Z","avatar_url":"https://github.com/AnthonyMazzie.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanthonymazzie%2Fbellmanford","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanthonymazzie%2Fbellmanford","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanthonymazzie%2Fbellmanford/lists"}