项目作者： rc-bandit4461

项目描述：
Using Dijkstra and Bellman Ford in C language

高级语言： C++

项目主页：

项目地址: git://github.com/rc-bandit4461/shortest_path_C.git

创建时间： 2020-04-05T19:40:31Z
项目社区：https://github.com/rc-bandit4461/shortest_path_C
开源协议：
下载

Shortest path in C and Graphviz language using two famous algorithms.

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.