搜索资源列表
tudebianli
- 图的遍历和生成树求解实现(邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现) -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
TU
- 图的基本操作,包括查找,遍历,删除,邻接表和邻接矩阵的转换-Fig basic operations, including search, traversal, delete, adjacency list and adjacency matrix conversion
Adjacencylisttraversal
- 遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.
topsorting
- 此函数功能是图的遍历算法,用邻接矩阵存储图,然后求出其拓扑排序,再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information
get_shortest_paths
- 通过定义邻接矩阵,计算节点之间的最短路径长度-By defining the adjacency matrix to calculate the shortest path between node length
ds_3
- 有向无环图的拓扑排序 用邻接矩阵保存图,边的输入采用三元组(求最短路径)和二元组(拓扑排序)。-DAG topological sort of the adjacency matrix with the preservation plan, while the use of triple input (for the shortest path) and the dual group (topological sort).
minspantree
- 最小生成树的克鲁斯卡尔算法 采用邻接矩阵存储图,用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation
disanti
- (1)自选存储结构,输入含n个顶点(用字符表示顶点名称)和e条边的图G; (2)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS(深度优先)顶点序列(提示:使用栈实现DFS); (3)指定任意顶点x为初始顶点,对图G作BFS(广度遍历),输出BFS顶点序列(提示:使用队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及与之相关连的边,并作DFS遍历(执行操作3);否则输出信息“不存在x”; (6)判断图G是否是连通图,输出信息“YES”/“NO
Depth-First-Traverse
- 此代码为“图的深度优先遍历”的源代码,图的存储形式为邻接矩阵,里面有图的邻接矩阵存储的代码,有深度优先遍历的算法,还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traver
c41
- 多段图用邻接矩阵存储,编写多段图问题的向后递推动态规划算法。-Multi-stage graph with adjacency matrix storage, the question of the preparation of multi-stage plan backward recursive dynamic programming algorithm.
zuiduanlujing
- 以邻接矩阵为存储结构,实现弗洛伊德算法求解每一对顶点之间的最短路径及最短路径长度。-Adjacency matrix for storage in the structure of each algorithm for the realization of Freud on the shortest path between the vertex and the length of the shortest path.
TSP
- 由图的邻接矩阵表示下广度优先搜索遍历改编来求TSP问题的近似解-Improve Breadth first searching graph algorith to solve TSP problem
mintreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name of the input parameters and format Prim in the call prior to the importation of adjacency matrix D and the node number n Input pri
TopoSort
- 实现拓扑排序:一个有向无环图,表述为一个邻接矩阵graph[n][n],其中graph[i][0]为顶点i的入度,其余为其后继结点。-The realization of topological sort: a directed acyclic graph, expressed as an adjacency matrix graph [n] [n], which graph [i] [0] for the vertex i of income, the remaining node to it
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G):将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g):将邻接表G转换成邻接矩阵g。 DispMat(MGraph g):输出邻接矩阵g。 DispAdj(ALGraph *G):输出邻接表G。 DFS(ALGraph *G,int v):以递归的方法从顶点v深度优先遍历图G。 =
c
- 采用邻接矩阵表示法创建有向图,是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c
daolujiaotongchaxun
- 道路交通查询:兰州道路交通网采用邻接矩阵(或邻接表)表示,包括道路交通网邻接矩阵(或邻接表)的建立、路径(或时间)的查询、最短路径(或最短时间)的查找、显示输出等功能;兰州道路交通网中顶点表示地名、图上的弧表示两地之间有路径存在、弧上的权值表示两地之间的距离(或时间); -Road Traffic Inquiry: Maryland road transport network using adjacency matrix (or adjacency list) that the road
duoduantudongtaiguihua
- 多段图问题的动态规划算法设计 1. 掌握有向网的成本邻接矩阵表示法 2. 能用程序设计语言实现多段图问题的动态规划递推算法 3. 基本掌握动态规划法的原理方法.-The issue of multi-stage plan the design of a dynamic programming algorithm. Grasp of the cost to the network adjacency matrix representation 2. Can be used pro
xiaoyuandaohangxitong
- 本课程设计的内容为“校园导航”,校园平面图中取大学的11个常去地点,其略图如图1,图中已标出主要路线,各路线的长度如表1中所示。任务定义:找出从任意场所到达另一场所的最佳路径(最短路径)。显然要解决这一问题要用“邻接矩阵”来存储各点间的距离,然后用Dijkstra求出最短路径。-The content of the curriculum design for the " Campus Map" plan of the campus from the University of
shujujiegou
- 先说说什么叫稀疏矩阵。你说,这个问题很简单吗,那你一定不知道中国学术界的嘴皮子仗,对一个字眼的“抠”将会导致两种相反的结论。这是清华2000年的一道考研题:“表示一个有1000个顶点,1000条边的有向图的邻接矩阵有多少个矩阵元素?是否稀疏矩阵?”如果你是个喜欢研究出题者心理活动的人,你可以看出这里有两个陷阱,就是让明明会的人答错,我不想说出是什么,留给读者思考-First talk about what is meant by sparse matrix. You said that the