搜索资源列表
w
- 单原点最短路径问题算法,在这个问题中,给出有向图G,它的每条边都有一个非负的长度(耗费) a [i ][ j ],路径的长度即为此路径所经过的边的长度之和。对于给定的源顶点s,需找出从它到图中其他任意顶点(称为目的)的最短路径。-Single-origin issue of the shortest path algorithm, in this issue, given directed graph G, each of which has a non-negative edge length
Topsort
- 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下: (1)在有向图中查找一个没有后继(或前驱)的顶点并添加到顶点表中。 (2)从图中删除该顶点和所有以该顶点为头(尾)的弧。 -The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algor
c
- 采用邻接矩阵表示法创建有向图,是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c
GraphPath
- 查找有向图、无向图的两点之间的所有路径。有使用方法。-It s method to find all path between two Node in a graph.
graph
- 图: 调试图的邻接链表存储的程序,解决下列问题: 根据教科书P157页的G2图(无向图),输入数据运行程序;再适当修改程序使它适用于G1图(有向图),输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run pro
071806210
- (1)、了解无向图和有向图的概念 (2)、掌握无向连通图或有向连通图的最小生成树的构造算法既Prim算法 (3)、了解有向图跟无向图的最短路径的解法 (4)、掌握图与网的基本概念和基本存储方法 -make your 111111111111
shujujiegou
- 先说说什么叫稀疏矩阵。你说,这个问题很简单吗,那你一定不知道中国学术界的嘴皮子仗,对一个字眼的“抠”将会导致两种相反的结论。这是清华2000年的一道考研题:“表示一个有1000个顶点,1000条边的有向图的邻接矩阵有多少个矩阵元素?是否稀疏矩阵?”如果你是个喜欢研究出题者心理活动的人,你可以看出这里有两个陷阱,就是让明明会的人答错,我不想说出是什么,留给读者思考-First talk about what is meant by sparse matrix. You said that the
CriticalPath
- 用顶点表示事件,弧表示活动,弧上的权值表示活动持续的时间的有向图叫AOE 。AOE网常用于估算工程完成时间。可通过本算法来计算关键路径-Activity On Edge Network
multiStageGraph
- 使用动态规划求多段图的C++源程序,用于满足最优化问题且问题能转换成一个有向图问题的求解,可以直接运行!-The use of dynamic programming for multi-stage plan of C++ source code, designed to meet the optimization problem and the problem can be converted into a directed graph to solve the problem, you ca
zuiduanlujing
- 在一个赋权有向图上寻找最短路径问题也是图应用的一个重要课题-Empowering in a directed graph to find the shortest path map application is also an important topic
the0ptimalproblem
- 求有向图问题的路径最优解,能推广运用到数学建模中-For the problem of path optimal solutions
E
- 使用改文档中的程序,可以直接开发出有向图的一个封闭的回路-E circle
Floyd
- Floyd 算法,创建有向图,无向图,有向网,无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm
Prime
- Prime 算法,创建有向图,无向图,有向网,无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
4-creatDG
- 1、 图的存储结构的定义和图的创建 图的种类有:有向图、无向图、有向网、无向网。 图的存储结构可采用:邻接矩阵、邻接表。 要求:分别给出邻接矩阵和邻接表在某一种图上的创建算法 -1, Figure storage structure definition and diagram types to create plans are: a directed graph, undirected graph, directed networks, undirected networks.
BuildAndOutputDiagramForC
- 用C语言实现数据结构中的图的建立和输出,可实现输出有向图和无向图,由用户自己选择建立有向图还是无向图的邻接矩阵。用户输入图的定点和边的信息,存储到相应的存储结构中去,而后输出图的邻接矩阵。-Data structure using C language implementation of the map creation and output, enabling the output have to map and undirected graph, chosen by the user to
graph
- 有向图的邻接表存储的实现,包括有向图的各种操作-Directed graph adjacency list storage implementation, including a variety of operations to the map
supermarket
- 学校超市选址问题(带权有向图的中心点) 设计要求:对于某一学校超市,其他各单位到其的距离不同,同时各单位人员去超市的频度也不同。请为超市选址,要求实现总体最优 -School Supermarket location problem (with the right of the center of a directed graph) design requirements: For a school supermarkets and other units to its
DIRECT_G
- 计算可达矩阵.在有向图中计算路径的种类,和路径的数目。-to compute accessable matrix.so we can count the paths through the matrix.
dijkstra
- 数据结构中非常经典和通用的算法,学习数据结构必须掌握的知识点,题目中的算法针对无向图,当然也适用于有向图,不过边的权值不能为负,否则不满足算法适用的条件-dijkstra