Description: 数据结构--c语言，广义表，图以及关键路径-Data structure- c language, generalized form, as well as the critical path diagram Platform: |
Size: 52224 |
Author:马俊 |
Hits:
Description: 本人讲授数据结构课程时的所写的示例程序，结构清晰规范，有注释，全部可编译运行，包括如下代码：
长整数：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
栈的顺序实现：ch3_sstack.c
括号的匹配检验：ch3_sstack_().c
串的定长实现：ch4_sstring.c
串的模式匹配：ch4_string_math.c
广义表的实现：ch5_GList.c
树的遍历：ch6_traverse.c
插入排序：ch10_InsertSort.c
拓扑排序和关键路径：ch7_critical_path.c-I taught courses at the time of the data structure of the sample written procedures, including the following code:
Long integer: ch0_bigint2.c
Implementation of the order form: ch2_stable.c
List of implementation ch2_ltable.c
Orderly merger of the two tables: ch2_stable_merge.c
Calculated expression: ch3_express.c
Queue implementation chain: ch3_lqueue.c
Chain stack implementation: ch3_lstack.c
Maze Solving: ch3_maze.c
The order of the queue implementation: ch3_squeue.c
The order of the stack implementation: ch3_sstack.c
Parentheses matching test: ch3_sstack_ (). C
Implementation of fixed-length string: ch4_sstring.c
String pattern matching: ch4_string_math.c
Generalized table implementation: ch5_GList.c
Tree traversal: ch6_traverse.c
Insertion Sort: ch10_InsertSort.c
Topological sort and the critical path: ch7_critical_path.c Platform: |
Size: 14336 |
Author:kk.h |
Hits:
Description: 采用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 Platform: |
Size: 2048 |
Author:刘晓 |
Hits:
Description: 一个暑假的课程设计题目，通过在表格输入AOE网络的节点和链，最后可以求出关键路径。-A summer course design topics, through the AOE network nodes and chain input in the form, and finally can find the critical path. Platform: |
Size: 1311744 |
Author:Tony |
Hits:
Description: c++实现数据结构的所有代码。包括线性表，树，图，排序，hash等。线性表实现堆栈，队列及约瑟夫环等多个应用，树实现哈夫曼树编码及译码，AVL树，线索化二叉树，森林和二叉树的相互转化等等，图实现图的几种建立方法，拓扑排序，最短路径，最大连通子图，双连通分量，最小生成树，关键路径算法等等，排序实现归并排序，快速排序，堆排序，shell排序，冒泡排序，选择排序，插入排序等，并对性能进行分析。hash实现闭散列表，开散列表，带溢出表的内散列表等，并使用5种hash函数。帮助同学们系统的学习数据结构及算法。-c++ code that implements all the data structures. Including linear tables, trees, graphs, sorting, hash, etc. Achieve linear form stacks, queues, and multiple applications, such as Josephus, tree Huffman coding and decoding trees, AVL trees, threaded binary tree, binary tree forest and into each other, etc., to achieve several graphs in Figure establishment method, topological sorting, shortest path, maximum connected subgraph, two connected components, minimum spanning tree, the critical path algorithms, etc., to achieve sort merge sort, quick sort, heap sort, shell sort, bubble sort, selection sort, insertion sort, etc. and to analyze performance. hash hash achieve closed, open hash table, the hash table with overflow in the other tables, and using 5 kinds of hash functions. Help students learn the system data structures and algorithms. Platform: |
Size: 6297600 |
Author:汪景行 |
Hits:
Description: 用邻接表存储有向图并建立AOE网；
用图形的形式输出有向图；
输出关键路径和关键活动。-Adjacency table is stored AOE directed graph and the establishment of networks
In the form of graphics output directed graph
Output critical path and critical activities. Platform: |
Size: 2048 |
Author:hjm |
Hits:
Search - critical path form