搜索资源列表
SCCandBC
- 求强连通分支,和双连通分支,输入两个文件,分别记录有向图和无向图-For strongly connected branch, and dual-branch connectivity, enter the two documents were recorded to map and undirected graph
tu
- 图的深度优先遍历包括图的建立,分有向图和无向图-Graph depth-first traversal, including the establishment of plans, sub-directed graph and undirected graph
graph
- c++实现的有向图的临界矩阵构造,深度广度的遍历。-c++ achieved critical digraph matrix structure, depth, breadth Ergodic.
BiconnectivityOfDirectedGraph
- 此程序用于解决有向图的强连通分支的求解问题!-Biconnectivity of directed graph
koeran
- 数据结构中带权有向图中心点的求解关于超市选址问题的课程设计,文件中包含代码和设计文档。-Data structure in weighted directed graph to solve the focal point of the question about the location of supermarkets curriculum design, the document contains the code and design documents.
youxiangtuopupaixu.txt
- 有向图的拓扑排序 通过邻接链表 排序-Directed graph topological sort to sort through the adjacency list
Path
- 最短路径的问题,求一个有向图中一个点到给定点的最短路径-The shortest path problem, and one has to map a point to give fixed-point shortest path
network_flow
- 最大流算法,对于给定的有向图,计算出该图上的最大流-Maximum flow algorithm, for a given directed graph is calculated on the graph of maximum flow
Larry_Wasserman_ALL_OF_Statistics
- 这本书就是著名的沃塞曼编写的《统计学完全教程》,它的特点是覆盖全面、实用性强,除常规内容还包括Bootstrap方法、有向图DAGs估计、Wald检验、Delta方法、统计泛函估计等。-This book is prepared by well-known Wasserman 《ALL OF Statistics》, which are covered by the characteristics of a comprehensive, practical, in addition to con
Dijkstra
- 该问题为单元最短路经问题,求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边,有向图的信息由一个邻接表来表示,另外对每个顶点都设置一个属性d[v],描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S,反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中,算法中还用到了顶点的最小优先队列,排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed
shortestpath
- 题目:编制一个求出网中最短路径的程序. 问题描述:计算一个有向网中位置为0 的点到其余各顶点的最短路径,以一个网状的带权有向图G6为测试内容 -Topic: establishment of a network to derive the shortest path procedure. Problem Descr iption: Calculate a network location to the point of 0 to the remaining vertex of the s
7_41
- 数据结构与算法利用深度优先遍历有向图求关键路径-Critical_Path()
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
DNA4
- 生物计算中哈密尔顿算法的设计与实现(有向图)-Biological calculation algorithm Hamilton Design and Implementation (directed graph)
S030602102
- 赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图,v是G的一个顶点, v的偏心距定义为: Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Descr iption: Let G = (V, E) is a directed graph Empoweri
Floyd
- 实现Floyd算法,并求所示有向图中各顶点之间的最短路径及其长度。-Floyd algorithm to achieve, and for directed graph shown in between the vertex and the length of the shortest path.
4.1
- 采用图的邻接表作为图的存储结构,完成有向图和无向图的DFS和BFS操作-The use of maps as a chart table adjacent to the storage structure, the completion of directed graph and undirected graph operations of DFS and BFS
tuopu
- 拓扑排序:对给定的AOV网判断网中是否存在环,检测的办法是对有向图构造其顶点的拓扑有序序列,若网中所有顶点都在它的拓扑有序序列中,则该AOV网中必定不存在环。在拓扑排序的基础上实现关键路径的的求解。-Topological Sort: AOV of a given network to determine the existence of ring network to detect the approach is the directed graph topological structure
Source
- 向边表示活动,边上的权值表示该活动的待续时间,则此带权的有向图称为用边表示“ 活动”的网(Activity On Edge Network),简称AOV网。通常AOV网上列出了完成预定工程计划所需要进行的活动,每项活动的计划完成时间,要发生哪些事件,及这些事件和活动的关系。为了进行人力、物力的调度和分配,以缩短工期,我们必须找出影响工程进度的关键活动,这就是关键路径的求解问题。通过计算机语言程序编程动态实现基于交通网络关键路径算法的动态实现,能够使学生利用所学知识解决实际问题,从而培养学生的编程
Dijkstra
- 带权有向图最短路径算法 Dijkstra算法-Weighted directed graph shortest path algorithm shortest path algorithm Dijkstra algorithm