-
hellow4
序列二次规划算法，能求解包含约束和无约束的问题，非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)
- 2021-01-08 18:18:51下载
- 积分：1
-
0908030206xin
一、 地理数据文件应用
对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。
要求：
1、在C++环境下，通过程序设计实现文本格式数据文件的操作；
2、在打开数据文件后，生成点、线、面三个链表，分别用于记录三种类型的数据。
3、数据文件结构说明
(Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)
- 2012-09-14 20:33:26下载
- 积分：1
-
00
说明： 还是通讯录系统 增删改查 课程设计 本科学校要求的数据结构课程设计(Or address book CRUD the data structures required by the curriculum design undergraduate schools curriculum design)
- 2012-06-17 21:36:24下载
- 积分：1
-
arc
运用二叉树求代数表达式的值，将代数表达式的每个符号用二叉树结点表示，遍历图的每一结点，按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
- 2012-06-23 19:52:38下载
- 积分：1
-
BeiDa_ACM1702
北大ACM1702题 转换为3进制
很经典(NULL)
- 2009-12-08 11:31:40下载
- 积分：1
-
Binary_tree
二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)
- 2011-10-22 23:51:28下载
- 积分：1
-
BDX
设计、编写和调试面向对象C++程序，实现任意两个同类数据比大小
的通用函数（模板），涵盖普通数值型数据之间的比较、两个字符串之间的比较
（按字典序）、两个复数之间的比较（按模大小）等，并通过主函数加以调用和
测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
- 2020-11-28 13:49:29下载
- 积分：1
-
Nqueen
n皇后问题构造法实现，比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)
- 2008-05-16 12:45:32下载
- 积分：1
-
mataqipan
马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
- 2006-05-30 20:05:17下载
- 积分：1
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分：1
