搜索资源列表
20056153639781
- 本文采用C++开发遗传算法，并由次算法解决最短路算法，函数最优化算法，取得了良好的效果。-this paper, C development of genetic algorithms, meeting with the shortest path algorithm for solving algorithms, function optimization algorithm, achieved good results.
dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 -Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. Main feature
program
- 经典算法编程，包括动态规划，最短路，回朔，高精度，数论的相关题型。-Classical algorithm programming, including dynamic programming, the most short-circuit, back to New Moon, high accuracy, the number of relevant questions.
the-shortest-path-of-chart
- 求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径-according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
2121
- C语言求解Floyd的最短路由花费,能够实现100以下节点的路由最短花费设计-C language for solving the Floyd shortest route cost routing node 100 minimum spend Design
java
- 是由 Richard Bellman 和 Lester Ford 創立的，求解單源最短路徑問題的一種演算法. 常見的最短路徑問題演算法還有 Dijkstra s algorithm, 且 Dijkstra 演算法不允許路徑的 cost 是負值, 但此演算法不受此限制. 但是如果圖形中有包含 cycle, 且 cycle 上面的 cost 的合為負值, 則此演算法不適合用於此種圖形-By Richard Bellman and Lester Ford founded, single-source
SDNdijkstra
- 基于SDN的dijkstra的算法实现。将此算法做成APP放置北向应用中，实现了最短路由功能-SDN Floodlight dijkstraalgorithm
kshortest
- 基于Djkstra的K最短路算法，完美运行，可以根据需要修改适应度函数-Djkstra K-shortest path algorithm, based on a perfect run, fitness function can be modified as needed
EBMR
- data structure广度优先搜索实现迷宫最短路(The data structure breadth-first search maze the short circuit)