Description: 傅清祥 算法与数据结构
它覆盖了《计算机学科教学计划1993》中开列的关于算法与数据结构主科目的所有知识单元。其主要内容有：算法与数据结构的概念、抽象数据类型（ADT）、基于序列的ADT（如表，栈，队列和串等）。反映层次关系的ADT（如树，堆和各种平衡树等）、关于集合的ADT（如字典，优先队列和共查集等）、算法设计的策略与技巧、排序与选择算法、图的算法、问题的计算复杂性、并行算法。 全书强调“算法”与“数据结构”之间密不可分的联系，因而强调融数据类型与定义在数据类型上的运算于一体的抽象数据类型，为面向对象的程序设计方法打下扎实的基础。 本书以知识单元为基本构件，具有可拆卸性和可重组性，内容丰富，表述详细，适合不同类型的院校按照不同的培养规格组织教学，其中基础部分可作为计算机学科各专业本科生的教材，高级专题部分可作为高年级本科生或研究生的教材。 -li, algorithm and data structure which covers the "Computer Science Teaching Program 1993" listed on the operator Law and data structures of all the main subjects of knowledge modules. Its main contents are : algorithm and data structure of the concept of abstract data types (ADT), Based on the sequence of ADT (table, stack, queue and strings, etc.). Reflect the level of relations between the ADT (such as trees, and balancing the heap tree, etc.), on the set of ADT (as a dictionary. Priority Queue and unearthed collection, etc.), algorithm design strategies and techniques, sorting and selection algorithms, graph algorithms, the computational complexity, parallel algorithm. Guidebook stressed that "algorithms" and "data structures," the inextricable link betwee Platform: |
Size: 11807424 |
Author:wu |
Hits:
Description: 傅清祥 算法与数据结构
它覆盖了《计算机学科教学计划1993》中开列的关于算法与数据结构主科目的所有知识单元。其主要内容有：算法与数据结构的概念、抽象数据类型（ADT）、基于序列的ADT（如表，栈，队列和串等）。反映层次关系的ADT（如树，堆和各种平衡树等）、关于集合的ADT（如字典，优先队列和共查集等）、算法设计的策略与技巧、排序与选择算法、图的算法、问题的计算复杂性、并行算法。 全书强调“算法”与“数据结构”之间密不可分的联系，因而强调融数据类型与定义在数据类型上的运算于一体的抽象数据类型，为面向对象的程序设计方法打下扎实的基础。 本书以知识单元为基本构件，具有可拆卸性和可重组性，内容丰富，表述详细，适合不同类型的院校按照不同的培养规格组织教学，其中基础部分可作为计算机学科各专业本科生的教材，高级专题部分可作为高年级本科生或研究生的教材。 -li, algorithm and data structure which covers the "Computer Science Teaching Program 1993" listed on the operator Law and data structures of all the main subjects of knowledge modules. Its main contents are : algorithm and data structure of the concept of abstract data types (ADT), Based on the sequence of ADT (table, stack, queue and strings, etc.). Reflect the level of relations between the ADT (such as trees, and balancing the heap tree, etc.), on the set of ADT (as a dictionary. Priority Queue and unearthed collection, etc.), algorithm design strategies and techniques, sorting and selection algorithms, graph algorithms, the computational complexity, parallel algorithm. Guidebook stressed that "algorithms" and "data structures," the inextricable link betwee Platform: |
Size: 11806720 |
Author:wu |
Hits:
Description: FibonacciHeap是一种优先队列，就平均而言有很好的性能，所以在一些图论算法中可以用来作改进算法的数据结构，尤其是那些稀疏图，总之是很好的工具。下面以设计者的角度简单描述我设计它的过程和思路。-FibonacciHeap is a priority queue, on average, have a good performance, so in a number of graph theory algorithms can be used to improve the algorithm for data structure, especially those sparse map, as long as it is a very good tool. Below a brief description of the designer s point of view I have devised the process and thinking it. Platform: |
Size: 4096 |
Author:哈哈哈 |
Hits:
Description: 无向图的最大割:对于给定的无向图G，设计一个优先队列式分支限界法，计算G的最大割。-Undirected graph of the largest cut: For a given undirected graph G, the design of a priority queue-type branch and bound method to calculate G, the largest cut. Platform: |
Size: 5120 |
Author:Jacky Gao |
Hits:
Description: 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解，能够熟练使用map容器，复习集合和字典的相关知识。理解最短路径问题，并使用Dijkstra算法解决最短路径问题。掌握线形表的使用，并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。
-Application of simulation using the tree railway inquiry function. Master graph adjacency list of definitions and applications, able to skillfully use the adjacency list. Enhance the understanding of map containers, able to skillfully use the map container, collection and review of the relevant knowledge dictionary. Understanding of the shortest path problem, and use the Dijkstra shortest path algorithm to solve the problem. To master the use of linear form, and understand the priority queue problem-solving process. Use the stack to resolve the issue of the need to reverse the output. Platform: |
Size: 2048 |
Author:sunfuquan |
Hits:
Description: 此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueue求解n皇后问题
QuickSort快速排序算法的实现。
Shell排序算法的实现。
Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。
tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package Platform: |
Size: 374784 |
Author:zouyan |
Hits:
Description: CS2208 - Data Structures Lab (Anna University)
EXERCISES
1a. Implement singly linked lists.
1b. Implement doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim s algorithm using priority queues to find MST of an undirected graph. Platform: |
Size: 209920 |
Author:Narayana Swamy |
Hits:
Description: 实验要求：请在下图所给出电路板中，按布线要求，利用队列式或优先队列分支限界法实现从a到b的布线工作
-Experimental requirements: On the graph below given circuit board, wiring requirements, queue or priority queue branch and bound method to achieve the wiring from a to b Platform: |
Size: 225280 |
Author:x |
Hits:
Description: 图论的各种最短路算法,竞赛用
包括dijkstra、Bellman-Ford（SPFA）、Floyd-Warshall、优先队列的应用等-A variety of graph theory shortest path algorithm, racing including dijkstra, Bellman-Ford (SPFA), Floyd-Warshall, the application of the priority queue Platform: |
Size: 4096 |
Author:Flandre·Scarlet |
Hits:
Description: 设图的顶点大于1个，不超过30个，每个顶点用一个编号表示（如果一个图有n个顶点，则它们的编号分别为0, 1, 2, 3, …, n-1）。
此题为求有向网中顶点间最短路径问题，可建立以票价为权的邻接矩阵，用Dijkstra算法求最短路径长度。
Dijkstra算法中有一个辅助向量D，表示当前所找到的从源点到其它点的最短路径长度。因为每次都要在D中找最小值，为提高性能，用最小值堆的优先队列存储D值。
-Let the vertex is greater than 1, no more than 30, with a number that each vertex (if a graph with n vertices, their numbers are 0, 1, 2, 3, ..., n-1). This network entitled to seek a shortest path between vertices, we can establish the right of the fare for the adjacency matrix, using Dijkstra' s algorithm for the shortest path length. Dijkstra' s algorithm has an auxiliary vector D, the found that the current from the source point to the other points of the shortest path length. Because every time to find the minimum value in the D, to improve performance, with the minimum heap priority queue storage D values. Platform: |
Size: 911360 |
Author:杜小方 |
Hits:
Search - graph priority queue