搜索资源列表
源代码(vc++)
- 里面装有 5 个小程序,分别是:0-1背包问题、二叉树遍历、链式表的实现、迷宫路径、资源最优配置算法。每个程序都有详细的说明,是我这两个学期所做的实验的一部分。-containing five small programs, namely : 0-2-1 knapsack problem, the binary tree traversal and the chain table and that the realization of the maze path, the optimal res
KONGQING
- 编译原理LR(0)文法分析器 录入合法的LR(0)文法,将输出LR(0)分析表,并可以对输入的句子进行语法分析输出相应语法树。程序中部分算法还很不简洁,有待改进,欢迎朋友与我多多交流。--compiler theory LR (0) grammar analyzer input legitimate LR (0) grammar, will output LR (0) analysis table, and may import for the sentence syntax analysis
shujujiegou
- 主要介绍数据结构,是对c语言学习的加强,主要介绍了排序,线性表,队列,数组,广义表,书和二叉树,查找,图等类容。-Introduces the data structure is the c language to enhance learning, introduces the sort, linear tables, queues, arrays, generalized table, books and binary tree, locate, map, and the like capa
shujujiegou_C
- 介绍了数据结构的基本概念、线性表、链接表、数组和广义表、树、图、查找和排序等,每章用大量的实例和图表来说明基本概念和方法.同时采用c语言作为算法的描述语言,算法也尽可能地少用抽象定义,而更多的是给出具体算法,并力求算法更接近于实际应用,使读者能更快地提高编程能力。-The book gives the basic concepts of data structures, linear tables, linked tables, arrays, and generalized table, tr
hash_with_avl
- it hashtable where every cell in the table is an avl tree , for minimum complexity .
Course-design-English-dictionary
- Trie树通常作为一种索引树,这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统,完成相应的建表和查表程序。-Trie trees usually as a tree, the structure on the index of the key word size change a lot is especially useful. Use Trie tree realize one English word memory system, complete au
Linear-table-design
- 实验一是线性表的设计与实现程序;实验二是栈和队列的应用程序;实验三是树型结构的应用程序;-The first experiment, the linear table design and implementation of procedures experimental application of stacks and queues In Experiment 3, the tree structure of the application
CTree
- 该程序是实现双亲表的算法,主要用于二叉树的应用-The procedure is the algorithm of the parent table, mainly used for the application of the binary tree
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
elght
- Master different methods to find, and can be used to achieve high-level language search algorithm. 2, master and orderly sequence table lookup method tables. 3, master binary sort tree structure, search, insert, and delete methods
1
- 对记录序列(查找表):{55,13,23,72,109,67,2,78,13}分别实现如下操作: 1) 顺序查找; 3) 对排好序的纪录序列表进行折半查找; 4) 利用1)中记录序列建立一颗二叉排序树,并在其上实现特定关键字值结点的查找; 5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表; 6) 实现5)创建哈希表上的查找 -On the record sequence (lookup table): {} 55,13,23,7
COMPLETE-DOCUMENT
- document explaning method of Neighbor Table Based Shortcut Tree Routing
新建文件夹
- 包含了线性表、栈、队列、二叉树、查找排序等多个内容,还实现了约瑟夫斯问题。(It includes many contents such as linear table, stack, queue, two fork tree, search sort and so on. The Josephus problem is also realized.)
U201514766
- 基于查找表的单词检索软件,设计与实现静态查找表、基于二叉排序树的动态查找表及HASH表等三种中的任意两种查找表结构及其抽象数据类型;以一本英文电子书(如英文小说,科普读物或圣经之类的社会书籍,书的篇幅不少于2万次单词)作为单词文本数据来源,使用上述查找表ADT,通过读取电子书而建立对应的两种查找表,以单词作为关键字,单词在书籍中出现的次数及每次出现的页码,行号等信息作为查找表数据元素属性;通过理论与实际测试结果对比分析两种查找表性能。(The design and implementation