为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and

利用输入邻接矩阵来求取2点之间的最短路径-Adjacency matrix to compute using the input the shortest path between 2 points

图论算法及matlab程序代码包含求任两点间最短路径的算法及代码Floyd、kruskal，最大匹配的匈牙利算法，并使用matlab程序实现。-Graph algorithms and matlab code includes the algorithm(Floyd, kruskal, maximal matching algorithm of Hungary,) to solve the shortest path between two points, and use matlab prog