Dijkstra Algorithm

Implementation of Dijstra Algorithm

Getting Started

This repository provides an C/C++ implementation of Dijstra Algorithm

Prerequisites

• C99 (or any GCC version)

Compilation

• Enter into the repository folder and type the following commands:

make clean
make

• All the executables files will be generated

Running

Here we tell how to run this program

• Call the executable by typing at terminal on project folder

./ep1.o <path_to_txtFile>/filename.txt

• The .txt file must have the following pattern

               n   m   s   t
               u₁  v₁  c₁
               u₂  v₂  c₂
                     . . .
               u_m v_m c_m

where,
              n is the vertices number;
              m is the arrows number;
              s is the origin vertice;
              t is the destination vertice;
              u_i and v_i are the origin and destination of the arrow i;
              c_i is the cost of the arrow i.

Behavior

For an input as follows:

./ep1.o example1.txt

We have the following output:

> Digraph:
5 7
1 2 5
1 5 10
2 3 4
2 4 13
2 5 2
3 4 7
5 4 6

> Minimum Path [1 to 4]: [1]->[2]->[5]->[4]