▍1. priority-queue
使用循环队列创建最小和最大优先队列,并使用堆排序方法去排序。(Using the circular queue to create the min and max priority queue, and using heap sort method to sort the queue.)
使用循环队列创建最小和最大优先队列,并使用堆排序方法去排序。(Using the circular queue to create the min and max priority queue, and using heap sort method to sort the queue.)
本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
构造哈夫曼树,并构造字符的哈夫曼编码,以凹入表(层次表)的形式显示哈夫曼树。(Huffman tree structure and construct characters Huffman encoding to recessed table (table level) displayed in the form Huffman tree.)
构造哈夫曼树,并构造字符的哈夫曼编码,以凹入表(层次表)的形式显示哈夫曼树。(Huffman tree structure and construct characters Huffman encoding to recessed table (table level) displayed in the form Huffman tree.)
Monkeys and peach,Monkeys and peach(Monkeys and peach)
Monkeys and peach,Monkeys and peach(Monkeys and peach)
hash_table的c语言的链表实现。包括一个简单的hash函数和hash_table的源码。(hash_table c language linked list implementation. Includes a simple hash function and hash_table source.)
hash_table的c语言的链表实现。包括一个简单的hash函数和hash_table的源码。(hash_table c language linked list implementation. Includes a simple hash function and hash_table source.)
参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
任务:实现Dijkstra算法 工程名:Project_ShortestPath 要求:实现Dijkstra算法,算法主体写在CGraph类中;要求是从command窗口中输入源节点编号,并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注:要输出整条路径,而不仅仅是前一跳,也不允许逆序输出。 (Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)
描述:足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数;普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序,实现对众多足球俱乐部管理的基本功能。具体功能包括: a) 俱乐部的增删改查,俱乐部的属性包括名称、现金、其下人员; b) 可以对所有球员的各项属性进行简单搜索,支持输入多个条件,条件之间用&&连接,例如: i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”,查询表达式:!(@age>25) && @experience>5 && @kick>100 c) 支持球员在不同俱乐部间的买卖,买卖需符合以下条件:作为买方的俱乐部的现金>=球员的转会费,交易完成后,卖方将得到转会费。 要求: d) 必须采用面向对象的方式,使用类组织数据结构,并注意类的继承关系; e) 在题目要求基础上可以自行扩展功能,提供扩实用扩展功能者适当加分(加分不超过5分)。 (Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include: a) the club CRUD, the name of the club s property, including cash, under which personnel b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example: i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100 c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)
描述:足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数;普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序,实现对众多足球俱乐部管理的基本功能。具体功能包括: a) 俱乐部的增删改查,俱乐部的属性包括名称、现金、其下人员; b) 可以对所有球员的各项属性进行简单搜索,支持输入多个条件,条件之间用&&连接,例如: i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”,查询表达式:!(@age>25) && @experience>5 && @kick>100 c) 支持球员在不同俱乐部间的买卖,买卖需符合以下条件:作为买方的俱乐部的现金>=球员的转会费,交易完成后,卖方将得到转会费。 要求: d) 必须采用面向对象的方式,使用类组织数据结构,并注意类的继承关系; e) 在题目要求基础上可以自行扩展功能,提供扩实用扩展功能者适当加分(加分不超过5分)。 (Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include: a) the club CRUD, the name of the club s property, including cash, under which personnel b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example: i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100 c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)
八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)