搜索资源列表
作业
- 单道环境下作业调度算法1、先来先服务算法2、最短作业优先算法3、最高响应比优先算法以及双道环境下的作业调度(In single channel environment, job scheduling algorithm 1, first come first service algorithm 2, shortest job first algorithm 3, highest response ratio priority algorithm and job scheduling in dua
Bellmanform Dynamic Programming
- Single Source Shortest Path Bellman ford
Dijkstra
- dijkstra 单源最短路径算法，用于计算一个节点到其他所有节点的最短路径(A single source shortest path algorithm is used to compute the shortest path from one node to all other nodes)
蚁群算法
- 求解单旅行商问题的智能算法，蚁群算法。 输入城市间赋权向量（城市间路程），即可输出经过所有城市且总路程最短的最小哈密顿环。(telligent algorithm for solving single traveling salesman problem, ant colony algorithm. By inputting the weight vector between cities (the distance between cities), the minimum Hamilton
python-algorithms-master
- python algrithms视频附例代码， 1. Log N Behavior 1.5 Big O SideBar 2. O(n log n) Behavior 3. Mathematical Algorithms 4. Brute Force Algorithms 5. KD Tree Data Structure 6. DepthFirstSearch 7. Seven All Pairs Shortest Path 8. Heap 9. Single-Source
Floyd
- 求解带权有向图中单源点的最短路径问题，在图论中有很好的应用(The shortest path problem of single source in weighted directed graph)
作业7
- 一．问题描述 设计、实现一个全国大城市间的交通咨询程序，为旅客提供三种最优决策方案：（1）飞行时间最短（2）总用时最短（3）费用最小（4）中转次数最少。 二、实验要求 （1）选取合适的数据结构存储带权路线图 （2）实现单源最短路径算法(1. Descr iption of the problem To design and implement a transportation consultation process between the major cities, we prov
dijkstra
- 直接运行即可，可以根据图的特征修改数据，两点之间能直接到达对应位置为数据，若不能直接到达，用1000表示。最后的结果显示为单出发点不同结束点的最短路程以及对应路径。(It can be changed directly according to the characteristics of the graph. Data can be directly arrived at the corresponding location between two points. If it can't be
SPFA
- 从图中的某个顶点出发到达另外一个顶点的所经过的边的权重和最小的一条路径，称为最短路径此处运用了SPFA的算法，可以解决单源最短路径(From the vertex of a graph, the shortest path is the weight and the smallest path to the edge of another vertex.Here we use SPFA algorithm to solve single source shortest path.)