搜索资源列表
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
图论算法库 C++ 语言实现
- 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压
生成最短路径贪心算法
- 《计算机算法基础》（华工版）关于单源点最短路径生成最短路径贪心算法；-"computer algorithms" (laborers version) on the single-source shortest path generation Shortest Path greedy algorithm;
the shortest path
- 用c++实现的单原点最短路径-used to achieve a single source shortest path
butter
- ACM测试数据，题目甜牛奶，练习单源点最短路径的好题。-ACM test data, the subject of sweet milk, practicing single-source shortest path a good title.
SPFA
- 求单源最短路的SPFA算法的全称是：Shortest Path Faster Algorithm。 从名字我们就可以看出，这种算法在效率上一定有过人之处。 -For single-source shortest path algorithm for the full name of the SPFA is: Shortest Path Faster Algorithm. From the name we can see that this algorithm in efficie
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
SSP
- I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performanc
dijkstra
- Dijktra s single source shortest path algorithm. The function takes a graph (which may be sparse) as an input and returns the matrix of shortest distances between all of the nodes. Additionally, individual source and sink nodes may be specified as ad
ksp
- 求解K短路问题的一种创新算子的单亲遗传算法源程序，该程序需要一个distance.txt文本文件，从中读取任意两点间距离数据。本程序所解决的为有26个节点的任意两点间K短路问题。-Solving K shortest path problem in an innovative operator of single-parent genetic algorithm source code, the program requires a distance.txt text file, read fr
TopoOrder_Level
- 单向图的最短路径搜索算法，首先对节点进行拓扑排序，然后实现复杂度为O（m）的最短路径搜索。-Single shortest path graph search algorithm, the first topological sort of nodes, and then implement the complexity of O (m) of the shortest path search.
Single-source-shortest-path
- 在vc6.0环境下，实现单源最短路径的迪杰斯特拉的完整算法-In vc6.0 environment, single-source shortest path algorithm Dijkstra complete
shortest-path
- 寻找单源最短路径问题的优先队列式分支限界法-Single-source shortest path problem priority queue type branch and bound
Bellman-Fords-Shortest-Paths
- The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.
single-gateway
- 在无线传感网络与物联网的异构融合中，通过单个网关连接是最常用的策略。本程序利用智能贪心算法寻找每个节点至网关的最短路径。-There are different approaches to integrate WSN into the Internet. The most usual one is to connect the WSN and the Internet through a gateway. This program makes uses of the greedy algorit
Single-source-shortest-path
- 单源最短路径的求解，摘自百度！ 希望对大家有帮助！-Single-source shortest path
Single-Source-Shortest-Path
- 从题目给出的N个节点以及相应距离中，找出单源最短路径，采用贪心算法-N nodes and the corresponding distances from the title given to find the single source shortest path, the greedy algorithm
shortest-path
- C++ program for Dijkstra s single source shortest path algorithm.The program is for adjacency matrix representation of the graph
shortest-path-of-N
- N最短路径是K最短路径（KSP）的变种，KSP指的是DAG中单源路径中前K条最短的路径- N shortest path is the shortest path (KSP) of K, KSP refers to the DAG in the single source path of the shortest path in the former K
The-shortest-path
- 最短路径(单源bellman_ford邻接阵形式)-The shortest path (single source bellman_ford adjacency matrix form)