搜索资源列表
GraphTraversal
- 使用c语言，利用数据结构思想建立图的邻接表的存储结构，实现无向图的深度优先遍历和广度优先遍历。以用户指定的顶点为起点，分别输出每种遍历下的顶点访问序列。 设图的顶点不超过30个，每个顶点用一个编号表示（如果一个图有N个顶点，则它们的编号分别为1，2，…，N）。通过输入图的全部边输入一个图，每条边是两个顶点编号对，可以对边依附顶点编号的输入顺序作出限制（例如从小到大）。 -Using c language data structure used to establish the adjac
Cpp1
- 编写算法，由依次输入的顶点数目、弧的数目、各顶点信息和各条弧信息建立有向图的邻接表-a goog program
graphy_theory
- 关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配，弦图判定，一般图最大匹配，有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed
AskToStrugglingConnectedComponents
- 输入一个有向图是数据，计算并给出该有向图的强联通分量。-I is a program that ask to struggling connected components
Dijskstra
- 给定带权有向图 ，其中每条边的权都是非负实数。另外，还给定V中的一个顶点，称为源点。现在要计算从源到所有其它各顶点的最短路长度。这里路的长度是指路上各边权之和；-Given weighted directed graph, where each edge of the right of all non-negative real number. In addition, the return of a vertex set V, called the source. Now calculated
dframe
- 利用模拟退火算法实现有向图最短路径的计算，基本与康立山的参数确定方法相同，只是结束条件改为温度下降到0.2截止。-Simulated annealing algorithm has to map the shortest path calculation, basic and Kang Lishan determine the parameters of the same way, but the conditions to end cut-off temperature dropped to
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
bianli
- 图的遍历，对有向图进行广度和深度优先遍历。-Graph traversal, directed graph on the breadth and depth-first traversal.
Graph
- 无向图 无向网 有向图 有向网的邻接矩阵的实现-Undirected graph directed graph undirected network with the network implementation of the adjacency matrix
built
- 有向图的建立,即用数据结构的只是建立一个又想吐-to built a graph,the graph has direct
createtu
- 用邻接矩阵创建图并将其输出：本程序可以有四种图形式：分别为有向图，无向图，有向网，无向网；-Create a map with the adjacency matrix and the output: This program can graph four forms: namely a directed graph, undirected graph, the network, not to the network
DFTravel
- 代码可以实现有向图及无向图的深度优先收缩-Code can achieve a directed graph and undirected graph depth-first contraction
allpath
- 有向图，所有路径计算，不包含环路，结果中忽略了环路-null
BBB
- 设有一个有向图存储在邻接表中。试设计一个算法，按深度优先搜索策略对其进行拓扑排序。并以右图为例检验你的算法的正确性。-There is a directed graph stored in the adjacent table. Trial design an algorithm, depth-first search strategy by the topology of its sort. And to test your example picture on the right algor
book_4node_allocate
- 电力系统潮流追踪程序 明确了在采用有功 /无功解耦追踪的方式下 ,由于有功或无功有向图不能同时提供用于损耗分摊的有功和无功功率分布信息 -Power Flow tracking program identified in the use of active/reactive decoupling tracking mode, active or reactive power as a directed graph can not provide for loss sharing active a
BFS_AND_DFS1
- 该代码为图的深度优先遍历和广度优先遍历，图的存储方式为领接矩阵存储，并且是有向图-The code for the graph depth-first traversal and breadth-first traversal, graph is stored as the leading access matrix storage, and is a directed graph
aaaa
- 带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm
graph
- 数据结构——图的基本结构 求给定图中的边（或弧）的数目。 求解出从给定顶点到所有顶点的最短路径（以边数计算）。 判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） 对给定的图G及出发点，设计算法从出发深度遍历图G，并构造出相应的生成树。 -Data structure- that the basic structure of the given graph edge (or arc) number. Solving out from a given vertex to a
kechengsheji
- 对于某一学校超市，其他各单位到其的距离不同，同时各单位人员去超市的频度也不同。请为超市选址，要求实现总体最优。（带权有向图的中心点）-Schools for a supermarket, other units of the distance of its different units while the frequency of the supermarket staff are also different. Please supermarket location, required to
floyd
- 一个很好用的弗洛伊德算法，对解决有向图的最短距离一招致命。-FLOYD method