给定带权有向图 ，其中每条边的权都是非负实数。另外，还给定V中的一个顶点，称为源点。现在要计算从源到所有其它各顶点的最短路长度。这里路的长度是指路上各边权之和；-Given weighted directed graph, where each edge of the right of all non-negative real number. In addition, the return of a vertex set V, called the source. Now calculated

Dijikstra algorithm in C language

用贪婪算法和最小路径法解决TSP问题，用matlab实现-With the greedy algorithm to solve the TSP problem and minimal path method, using matlab realize

Dijkstra算法用于求最短路径，是数据结构的一个基本算法，欢迎大家使用(Dijkstra algorithm for solving the shortest path, is a basic algorithm of data structure, you are welcome to use)