A program that uses Dijkstra's algorithm to find the shortest path. It reads the values of the adjacency edges from the Excel file.
The program needs to fill in the data correctly in the excel file.
Example:
First string consists of all vertexes in graph.
You can also find an example file with the correct format in Tests/example.xlxs.
To find the shortest distance between two vertices, you need to specify the name and path to the Excel file, as well as the desired vertices.