Overview

In this practical, you will write a C program to find the shortest path on a graph using

Dijkstra's algorithm.

Instructions:

Graph Representation:

The graph will be represented as a CSV file where each row represents an edge with

the following format: "Vertex$1,$ Vertex$2,$ Weight". The vertex labels are always capital

letters and only one letter long.

Menu Options:

Your program should provide the following menu options:

Add a new graph to be saved in CSV format.

Choose to work with a specific graph from the saved CSV files.

Choose to find the shortest path based on the active graph from the CSV$.$

Adding a New Graph:

Prompt the user to enter the details of the new graph $($vertexes and weights$).$

Save the graph in a CSV file.

Working with a Specific Graph:

List all CSV files in a specific folder directory dynamically.

Prompt the user to choose a file to import.

Finding the Shortest Path:

Prompt the user to enter the start and end vertexes.

Use Dijkstra's algorithm to find the shortest path.

Display the path and its total weight.

Example

This is an example of a graph $($left$)$ that could be provided on demo day. You should then

be able to input the details into your program and generate the resulting CSV file $($right$).$

Note: Vertex labels are always capital letters and only one letter long. $($File is provided$).$

$A,B,3$

$A,C,2$

$B,D,2$

$C,D,1$

$C,B,4$

$D,B,2$