Dijkstra Algorithm Visualizer

A MATLAB-based app capable of visualizing the shortest paths and spanning trees from an input directed graph using the Dijkstra algorithm.

Requirements

• Software:
  • MATLAB R2019a or later.
• Input file:
  • The file must be named 'Graph.dat', and must follow the given format:
    • First line must indicate the number of nodes.
    • Node name must be numbers from 1-1000000.
    • Weights must be between 0-9 (indicated by red numbers in image).
    • Note: If desired, one can generate a random graph using the GraphGenerator script.

Operating Modes:

• Auto:
  • Allows the user to display an individual node's shortest path tree (SPT). The output file will consist of all possible paths for all nodes in the graph.

• Manual:
  • Lets the user choose the start and end nodes for the graph. The output file generated will be based on the starting node.