https://github.com/anthonymazzie/bellmanford
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.
https://github.com/anthonymazzie/bellmanford
algorithm bellman-ford computer-science graph
Last synced: 4 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/anthonymazzie/bellmanford
- Owner: AnthonyMazzie
- Created: 2022-12-12T18:20:18.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2022-12-12T18:29:16.000Z (almost 3 years ago)
- Last Synced: 2025-06-21T10:06:12.092Z (4 months ago)
- Topics: algorithm, bellman-ford, computer-science, graph
- Language: Java
- Homepage:
- Size: 157 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files: