搜索资源列表
pengyunhui-5
- 对于给定的一个工程施工图，该图以边为单位从键盘输入，编写能够找出该图的关键路径的程序。-For a given a construction diagram, the diagram in order to edge as a unit from the keyboard input, write code that will identify the critical path of the map program.
Topo_logical_Order_7_12D
- 拓扑排序,并求关键路径.按UDG图的格式输入，程序创建UDG图，然后求关键活动，进行拓扑排序，最后将拓扑排序的结果输出。-Topological sort, and seek the critical path. By UDG graph format input, the program creates UDG chart, key activities and then seek to carry out topological sort, and finally output the re
main
- 关键路径，这是数据结构的内容！！！给正在学习的同学一些参考。-The critical path, this is the content of the data structure! ! ! To the students are learning some reference.
criticalpath.tar
- this project for finding critical path in wireless networks implemented using ns2-this is project for finding critical path in wireless networks implemented using ns2
keyroad
- 用C语言给出了关键路径算法的实现，可以帮助读者较好的理解关键路径思想-With the C language are given the realization of the critical path algorithm that can help readers better understand the thinking of the critical path
plugin-tut_timing_verilog_Lab2
- manual for time analysis and testing the critical path in verilog FPGA using Accumulator design
210405
- 关键路径的代码，可以运行，可进行不同类型数值的计算，很好用。-The critical path of the code, you can run, can be different types of numerical calculations, it just works.
depth
- 本源码利用C++语言实现了深度优先求解关键路径的算法，对进一步了解数据结构相关知识有益-The source code to use C++ language to implement the depth-first algorithm for solving the critical path for a better understanding of data structures useful knowledge
keyroad
- 编写一个检查树种的关键路径程序，有图形界面-Write a check of the critical path tree procedures, graphical interface
path01
- C++ 寻找关键路径 根据AOE网络寻找关键活动，确定关键路径 最好的解决方式-C++ find the critical path
TTU
- 《数据结构》课程设计 建立并显示出有向图的邻接链表； 对该图进行拓扑排序，显示拓扑排序的结果，并随时显示入度域的变化情况； 给出它的关键路径（要求：显示出VE,VL,E,L,L-E的结果）。-" Data Structure" Course Design has established and demonstrated to the adjacency list the topological sort graph shows the results of top
a
- 这是寻找关键路径的超炫的C++源代码，超值得-It is stunning to find the critical path of C++ source code, value was
guanjianlujing
- 关键路径C++实现 C + + to achieve the critical path-C++ to achieve the critical path
cPMsuanf
- 关键路径通常是在拓扑排序的基础上求得的。本文算法中设计了一些独特的数据结构，在算法运行的整个 过程中，求发点(源点)到收点(终点)的关键路径的过程(入栈、出栈等操作)实际只进行一遍，不需要进行拓扑排序，算法的时间 复杂度为O(n+e)，较传统的算法效率更高-Critical path is usually calculated based on the topological sort of. This algorithm designed some unique data struct
criticalpath
- 关键路径算法，对给定的网络结构，用关键路径算法可以给出具体的找到必须要走的路径-Critical Path, on a given network structure, with the critical path algorithm can be found given a specific path that must be taken
graph
- 采用C语言编写的图的运用，即实现了图的基本功能，也能形成图的实际运用如关键路径-Figure C language with the use of, or realize that the basic function, but also form a map of the practical application, such as critical path
AOE
- java 语言实现AOE网与关键路径的查找-java language AOE network and find the critical path
guanjianlujing
- 数据结构 实现AOE网的关键路径算法-AOE network data structure to achieve the critical path algorithm
tu
- 图的应用，有关键路径，dijkstra算法，和floyd算法-Map applications, critical path, dijkstra algorithm, and floyd algorithm
guanjianlujing
- 实现图的关键路径算法，关键路径的成功查找-To achieve the critical path diagram algorithm to find the success of Critical Path