Shortest Path Solver

Hannah Brown, Cullen Doyle, Molly Suppo

September 1, 2025

What are Graph Data Structures?

• Non Linear Data Structure
• Weighted, Connected, and Directed
• Adjacency Matrix

Our Solution to the Shortest Path Finder Using the Bellman-Ford Algorithm

How Does the Bellman-Ford Algorithm Work?

• Constantly updates the shortest distance between vertices
• Distance is the same as the weight variable for each edge
• Bellman-Ford is able to utilize negative and positive weights
• We used positive weights to mimic the book solution

The Shortest Path Finder Problem is Tractable?

• According to the book, yes
• Negative weights and cycles refute the book
• Can get stuck in a cycle if there are negatives

Citations

• Shortest Path https://www.w3schools.com/dsa/dsa_theory_graphs_shortestpath.php
• Shortest Path Solution (Bellman-Ford Algorithm): https://www.w3schools.com/dsa/dsa_algo_graphs_bellmanford.php
• Graph Data Structures https://www.w3schools.com/dsa/dsa_theory_graphs.php