Search - 工程代码

Search - 工程代码 - List

[Data structs] 大数运算类实例 DL : 0: 在计算机科学中有一类分常重要的代码工具是抽象的大数运算类，本工程实现对大数加减乘除的封装及实例-in computer science is often an important sub-category of tools is the code of large numbers Operational abstract category, the majority of projects to achieve the arithmetic package and examples
Date : 2025-12-21 Size : 5kb User : 刘胜国
[Data structs] xishujuzenh DL : 0: 稀疏矩阵 1、应用程序直接可以实现矩阵的各项操作。 2、查看原代码VC++6.0打开“稀疏矩阵\creatematrix.dsp”或者用记事本打开“稀疏矩阵\creatematrix.cpp” 3、代码简单说明: 本程序是一个工程文件包含了链式与顺序两种多项是处理方式：十字链表：矩阵的结构体：matnode；三元组顺序：矩阵结构体：tsmat 4、ADT在文件夹“稀疏矩阵”里 -a sparse matrix, the application can be achieved directly by the matrix operation. 2, VC View 6.0 source code open "Sparse Matrix \ creatematrix.dsp" or use Notepad to open the "sparse matrix \ creatematrix.cpp" 3, code simple note : this program is a project file contains a sequence of two chain with a number of approaches : Cross Chain : the structure of the matrix : matnode; Triples order : the structure matrix : tsmat 4, ADT in the folder "Sparse Matrix"
Date : 2025-12-21 Size : 16kb User : upcorange
[Data structs] duoxiangsih DL : 0: 1、应用程序直接可以实现多项式的各项操作。 2、查看原代码VC++6.0打开“多项式\poly88.dsp”或者用记事本打开“多项式\poly88.cpp” 3、代码简单说明: 本程序是一个工程文件包含了链式与顺序两种多项是处理方式：链表存储结构：多项式类是polynomail，节点类是polynelem；顺序存储结构：多项是结构体是Ploynomial，节点类是term。 4、注：在运行应用程序"多项式.exe"时，在菜单上选链式存储与顺序存储的系数和指数的输入的顺序是不同的,请根据提示输入系数与指数。 5、ADT在文件夹“多项式”里-1, applications can be achieved directly in the operation of polynomials. 2, VC View 6.0 source code open "polynomial \ poly88.dsp" or use Notepad to open the "polynomial \ poly88.cpp" 3, code simple note : this program is a project file contains a sequence of two chain with a number of approaches : Listless Storage Structure : polynomial is the polynomail, polynelem node category; sequence storage structure : the structure of a number of Ploynomial, node is the term. 4 Note : running applications "polynomial. Exe "at the election menu sequence chain storage and storage coefficient and the index of input sequence is different, according to suggest input coefficient and index. 5, ADT in the folder "polynomial" Lane
Date : 2025-12-21 Size : 70kb User : upcorange
[Data structs] 200811 DL : 0: 此为最优二叉搜索树程序源码，属软件工程算法设计与分析类-This is the optimal binary search tree program source code, an algorithm for software engineering design and analysis of type
Date : 2025-12-21 Size : 29kb User : 何妮
[Data structs] Binary_Tree DL : 0: Binary_tree.cpp ：执行文件生成所有二叉树这样做的目的C + +程序是产生所有二叉树指定节点数目。基本思想是衍生所有二叉树基于退化树。该算法的动机是圆括号法则代表二叉树。一组括号可通过字典秩序排列，由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性它一直在改变过去的节点从最新二叉树下一可能位置（在这里，我们假设右向是正确的退化树方向）。该文件还提到计算机内存时（读/写）和avarage参考值。这个工程在Microsoft Visual Studio 2005环境。-//Binary_tree.cpp : implementation file for generating all the binary tree //The purpose of this C++ Program is to generate all the binary trees given the node number. //The basic idea is to evolve all the binary trees from the degenerate tree. //The algorithm is motivated by the parenthesis representation of binary trees. //The parenthesis set can be organized through lexicographical order. But the algorithm //in the code has not simply converted from parenthesis representation instead //it has kept on shifting the last node from the latest binary tree to the next //possible left handside position(here we assume the degenerate tree is right handside). //This file has also computed the memory reference times(read/write) and avarage //reference times. // //This program works in microsoft visual studio 2005 environment.
Date : 2025-12-21 Size : 3kb User : hunter
[Data structs] clock DL : 0: 1. 首先建立一个基本对话的exe工程，并命名为time； 2. 在BOOL CTimeDlg::OnInitDialog()函数内建立一个计时器，SetTimer(1,1000,NULL) 3. 再用classwizard建立消息响应函数void CTimeDlg::OnTimer(UINT nIDEvent)，在里面输入代码如下：Invalidate() 4. 再用classwizard建立消息响应函数void CTimeDlg::OnDestroy()，在里面输入代码如下：KillTimer(1) 以此来消除计时器； 5. 在void CTimeDlg::OnPaint()里输入上面的算法； 6. 为CtimeDlg类添加头文件math.h，代码：#include "math.h"。 7. 编译、链接、运行。 -1. First, the establishment of a basic dialogue exe project, and named the time 2. In the BOOL CTimeDlg:: OnInitDialog () function is the establishment of a timer, SetTimer (1,1000, NULL) 3. Then the establishment of the message to respond to classwizard function void CTimeDlg:: OnTimer (UINT nIDEvent), enter the code inside is as follows: Invalidate () 4. then classwizard set-up message response function void CTimeDlg:: OnDestroy (), enter the code inside the following: KillTimer (1) to this to eliminate the timer 5. void CTimeDlg:: OnPaint () where importation of the above algorithm 6. CtimeDlg class to add header file for the math.h, the code:# include " math.h" . 7. Compile, link and run.
Date : 2025-12-21 Size : 1.82mb User : tmacq3
[Data structs] middlg DL : 0: 1. 建立一个基本对话的exe工程，并命名为circle； 2. 插入一个对话框资源，以在此对话框上输入圆心坐标、半径及颜色，并为此建立一个新类，命名为CDlg； 3. 在IDD_CIRCLE_DIALOG上删除已有控件，并添加一个Button，命名为Button1； 4. 在CcircleDlg内添加3个double型成员变量，命名为x，y，r，然后添加1个COLORREF的成员变量，命名为color； 5. 在CDlg内加入3个Edit box，在加入一个button2； 6. 在CDlg内用classwizard为3 个Editbox添加3个double型成员变量，命名为m_x，m_y，m_r，然后添加1个COLORREF的成员变量，命名为color1； 7. 用classwizard为button2添加消息响应函数void CDlg::OnButton2()，在此函数内输入下列代码 CColorDialog m if(m.DoModal()==IDOK) color=m.GetColor() 8. 为此Button1添加一个消息响应函数void CCircleDlg::OnButton1()，在此函数内输入下列代码 CDlg dl dl.DoModal() x=dl.m_x r=dl.m_r -The accuracy of the algorithm is affected by the slope, if the slope is greater than 2, then a straight line can be observed as dotted lines, the slope is greater than one of the most perfect.
Date : 2025-12-21 Size : 1.62mb User : tmacq3
[Data structs] code DL : 0: 数据结构与算法分析 (第二版) 课本代码以及各个工程源代码-A Practical Introduction To Data Structures and Algorithm Analysis(C++)
Date : 2025-12-21 Size : 144kb User : chen
[Data structs] Data-structure-rearrangement DL : 0: 实现数据结构中车厢重排问题的完整c++代码；可以完美运行；完整的一个工程，包含debug后的相关文件和生成可执行程序-Data structure inside a complete rearrangement of the problem c++ code works perfect complete a project, including relevant documents and after the debug build executable
Date : 2025-12-21 Size : 739kb User : wy
[Data structs] run DL : 0: 动态规划实现高精度运算程序，内含整个C工程，内容完整，代码可行-Dynamic programming to achieve high-precision computing program, containing the entire C project, content integrity, code possible
Date : 2025-12-21 Size : 387kb User : liu
[Data structs] sorts DL : 0: 插入、合并、快速、冒泡、桶排序性能分析标准C++代码，运用面向对象的设计理念，整体结构紧凑富有逻辑性具体算法参照《算法导论》第四版 vs2010下可以正常运行其他环境下，请自行建立工程，并拷贝sorts目录下sorts.cpp CalTime.h CalTime.cpp的内容 -Insert, merge, quick, bubble, bucket sort performance analysis Standard C code, the use of object-oriented design, the overall logical structure of compact Specific algorithm reference "Introduction to Algorithms," Fourth Edition can run under vs2010 Other circumstances, please create your own projects, and copy the sorts directory contents sorts.cpp CalTime.h CalTime.cpp
Date : 2025-12-21 Size : 3.48mb User : Beef
[Data structs] C_E DL : 0: 工程上常常遇到圆和椭圆的拟合算法。本资料包括doc说明和vc代码，教你如何实现拟合。-fitting algorithm for circle and ellpase
Date : 2025-12-21 Size : 40kb User : xuxiangxing
[Data structs] sicily-1716 DL : 0: 中山大学online judge sicily平台1716题目的详细代码和工程文件-1716 the subject of Sun Yat-sen University online judge sicily platform code and project files
Date : 2025-12-21 Size : 2.39mb User : jan
[Data structs] SA DL : 0: 压缩包中的工程包含了三种风格。adtstyle文件夹对应的是抽象数据风格，invretstyle文件夹对应的是调用返回风格，pipestyle文件夹对应的是管道过滤器风格。源代码是用MyEclipse 6.5写的。可直接将工程导入MyEclipse中即可运行，也可以运行SA文件夹里面的start.bat选择某个风格运行。抽象数据风格的按字母排序算法用的是快速排序算法，代码位于SA\src\adtstyle\impl.AlphabetizerImpl.java，调用返回风格用的是插入排序算法，代码位于SA\src\invretstyle\Alphabetizer.java，管道过滤器风格用的是堆排序算法，代码位于SA\src\pipestyle\Alphabetizer.java。三种风格都对一些噪音词汇进行过滤，private static final String ignore = "a#$an#$and#$as#$is#$the#$of#$"，上面语句中由"#$"间隔开的就是噪音词汇。SA\input.txt是输入文件，可对其进行配置来解析不同的文本。-The compression works package includes three different styles. adtstyle folder corresponding abstract data style, invretstyle folder corresponding to the call returns the style, pipestyle folder corresponding to the pipe filter style. The source code is written using MyEclipse 6.5. Directly to the project into MyEclipse to run can run SA folder inside the start.bat select a style run. Abstract data-style alphabetical sorting algorithm is quick sort algorithm, the code is located in SA, \ src \ adtstyle \ impl.AlphabetizerImpl.java, call return style is the insertion sort algorithm, the code in SA \ src \ invretstyle \ Alphabetizer.java pipe filter style using a heap sort algorithm, the code is located in SA, \ the src the \ pipestyle \ Alphabetizer.java. Three styles of some noise words filter private static final String ignore = " a# $ an# $ and# $ as# $ is# $# $ of# $" , " # $" in the above statement spaced noise words. SA, \ input.txt yes the input file can be confi
Date : 2025-12-21 Size : 38kb User : 杨诗听
[Data structs] quadtree DL : 0: 高效率四叉树实用代码，VC6工程，纯C语言实现-Practical code of the high efficiency of quadtree, VC6 project, pure C language
Date : 2025-12-21 Size : 10kb User : 骆朝亮
[Data structs] spiralData DL : 0: c++编写的一个螺旋数据输出的实例工程代码！-spiral data algorithm
Date : 2025-12-21 Size : 649kb User : www