搜索资源列表
数据结构的C++描述
- 目 录 译者序 前言 第一部分 预备知识 第1章 C++程序设计 1 1.1 引言 1 1.2 函数与参数 2 1.2.1 传值参数 2 1.2.2 模板函数 3 1.2.3 引用参数 3 1.2.4 常量引用参数 4 1.2.5 返回值 4 1.2.6 递归函数 5 1.3 动态存储分配
JAVA闹钟
- 数据结构上机实验的一些源代码。包含哈弗曼编码译码器，二叉树的遍历，算术表达式求值，拓扑排序等。
topologicalorder
- 本程序用VC++实现有向图，无向图，有向网，无向网的拓扑排序-This program with VC++ to achieve a directed graph, undirected graph, a directed network, the network topology without sorting
Graph
- 创建有向图的邻接表，在此临界表的基础上进行拓扑排序-Create a directed graph adjacency table, the table in this critical topological sort on the basis of
ApplicationsOfDepth-FirstTraversal
- 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。 通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DFS to test if a given undirecte
greed
- 贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题-Greedy algorithm Collection, including two sub-coverage, single-source shortest path, topological sort, machine scheduling problem
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
algraph_binary_tree_huffmantree
- 创建静态，动态的三叉霍夫曼树和编码，有向无环图的创建及拓扑排序，双向循环链表，表达式求值，单链表，集合在一起-Create static and dynamic Huffman tree of the trigeminal and coding, directed acyclic graph creation and topological sort, two-way circulation list, expression evaluation, single-chain, together
TopSort
- 图的拓扑排序。采用邻接表存储结构。其中包含有栈的操作。-Map topological sort. The use of the adjacent table storage structure. Which contains a stack operation.
TopologicalSort
- Visual C++ 实现拓扑排序功能-Visual C++ Achieve topological sorting function
TraversingGraph
- 图的遍历算法是求解图的连通性问题、拓扑排序和求关键路径等算法的基础-Graph traversal algorithm is to solve the graph connectivity problem, topological sorting and demand, such as critical path algorithm
sorting
- 数据结构课程设计_拓扑排序 用邻接表构造图 然后进行拓扑排序 -Data Structure Course Design _ topological sort graph using adjacency list structure and then proceed to topological sorting
youxiangtuopupaixu.txt
- 有向图的拓扑排序 通过邻接链表 排序-Directed graph topological sort to sort through the adjacency list
datastruct_example
- 本人讲授数据结构课程时的所写的示例程序，结构清晰规范，有注释，全部可编译运行，包括如下代码： 长整数：ch0_bigint2.c 顺序表的实现：ch2_stable.c 链表的实现ch2_ltable.c 合并两个有序表：ch2_stable_merge.c 表达式计算：ch3_express.c 队列的链式实现：ch3_lqueue.c 栈的链式实现：ch3_lstack.c 迷宫求解：ch3_maze.c 队列的顺序实现：ch3_squeue.c
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
Toplogical_Sorting
- 这个课程项目完成了给定DAG graph，找到所有拓扑排序并且输出。用到了指针和链表。对于学习C/C++和数据结构比较有帮助。-this course project has output all the topological sorting given the nodes and relation for the DAG graph. This is very helpful for practicing pointer/link list in C/C++ and data structu
graph
- 图论的一些常用代码，包括最小生成树，拓扑排序，最短路径（非负权和负权）-Graph theory, a number of commonly used code, including the minimum spanning tree, topological sorting, shortest path (non-negative and negative rights)
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).
Map22
- 有向无环图是描述一项工程进行过程的有效工具,主要进行拓扑排序和关键路径的操作。构建了有向无环图的一系列操作的实现.-Directed acyclic graph to describe the process of a project carried out an effective tool, mainly for topological sort and the operation of the critical path. Construction of a directed acycli
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