Using Dijkstra and Bellman Ford in C language
This application uses Dijkstra and Bellman-Ford Algorithms in C language, to output a Graphviz file in dot language. the file can then
read by Graphviz parser to output a graph showing the shortest path.
Note: comments on the code are in french.