Shortest Path Problem

Introduction

A Java implementation of the generic label-correcting algorithm and four modified label-correcting algorithms that solve the shortest path problem:

• Abstract Label-Correcting Algorithm
  • Generic Label-Correcting Algorithm
  • Modified Label-Correcting Algorithm
    • Queue (FIFO)
    • Stack
    • Dequeue
    • Minimal Distance Label

All algorithms could detect and report negative cycles based on the Moore-Bellman-Ford algorithm.

Moreover, the repository also includes an algorithm analysis report that describes the implementation details, performance comparison, and how it handles negative cycles.

Other

This repository is migrated from Rose-Hulman CSSE Git Server, and the project itself is my coursework for MA446 at Rose-Hulman Institute of Technology.