搜索资源列表
shool_wizard
- 自己做的校园导航图，大二有关迪杰斯特拉算法的实验，包括界面-Do their own campus navigation map, the Dijkstra algorithm sophomore experiments, including the interface
Dijkstra
- 图论经典算法用代课死图拉的算法解决问题的算法-tulunjingdian
zdlj
- 图的迪杰斯特拉算法，本人亲自将课本的代码打出来并进行了修改-Graph Dijkstra algorithm, I personally would play out and the code books were modified
PSO-image-segmentation-algorithm
- 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于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
dijkstra
- dijkstra算法，经典的求路径最优算法，可以-dijkstra algorithm, find the optimal path algorithms classic, you can try
Dijkstra
- Dijsktra算法，图论中的基础算法，用来求网络图中始发点到各个点的最短路，并给出权值-Dijsktra algorithms. in graph theory of the basic algorithm that is used to ask the network diagram to the point of the short, and gives to
dijkstra
- 图论算法，计算最短距离.描述了一个节点到其他节点的最短距离-graph theory.it include a algorithm of dijkstra.it display the min path between a node to any other nodes
dijkstra
- 用于图像分割的dijkstra距离的计算，用于最大流最小割等算法-To dijkstra distance calculation used to image segmentation for the maximum flow minimum cut algorithm
Dijkstra
- 该算法思想是寻找距离比较近而且灰度相似的成分，对于目标和背景灰度差别明显的物体的分割效果较好。-The algorithm idea is looking for a relatively close distance and gray similar ingredients, there is no obvious difference between the target and background gray objects segmentation better.
Dijkstra[VCPP]
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for calculating a node to all other nodes in the shortest path.
Dijkstra
- 单源最短路径Dijkstra。使用图论算法作为图像处理的基础算法，Dijkstra和Bellman-Ford类似，都是解决单源最短路径问题，不同的是这个方法只能解决边为非负的问题，实现的好的Dijkstra算法运行时间要快于Bellman-ford。-Single source shortest path Dijkstra. Using graph theory algorithm as the basis of image processing algorithms, Dijkstra and
Bellman-ford
- 单源最短路径Bellman-ford。该算法可以用来解决一般（边的权值为负）的单源最短路径问题，而dijkstra只能解决权值非负的情况。此算法使用松弛技术，对每一个顶点，逐步减少源到该顶点的路径的估计值，直到达到最短的路径。-Single source shortest path Bellman-ford. The algorithm can be used to solve the general (the right side is negative) single-source shor
tronsparent
- Dijkstra算法通过邻接表实现最短路径,()
tdwm7
- 换乘次数最少是乘客出行时考虑的首要因素,描述了传 统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最()