Search - CALL - CodeBus

Search - CALL - List

[Data structs] AirLine DL : 0: 航空最短路径探测，VB调用D-aviation shortest path detection, call VB D
Date : 2025-12-25 Size : 5kb User : 沈麒
[Data structs] ercheng DL : 0: 最小二乘法曲线拟合的经典算法，做过特征数检验，只需调用fit，文件中其他函数被fit调用，其中个输入输出变量均以给出详细说明。-least squares curve fitting classic algorithms, the number of tests done, just call fit, the paper other function to be fit Call, 000 input and output variables were presented in detail.
Date : 2025-12-25 Size : 2kb User : 阿宇
[Data structs] 软件工程设计最终完成 DL : 0: 人事管理系统，软件工程课程设计，TC3下调试成功，采用链表结构，实现增加删除查询等功能，调用汉字库实现汉字输出-Personnel Management System, software engineering curriculum design, debug TC3 successfully used Chain structure, the added features such as deleted inquiries, call for Chinese exports Store
Date : 2025-12-25 Size : 1.17mb User : 张亮
[Data structs] 广义表的表头和表尾 DL : 0: 广义表是线性表的推广。广义表是n个元素的有限序列，元素可以是原子或一个广义表，记为LS。若元素是广义表称它为LS的子表。若广义表非空，则第一个元素称表头，其余元素称表尾。表的深度是指表展开后所含括号的层数。把与树对应的广义表称为纯表，它限制了表中成分的共享和递归；允许结点共享的表称为再入表；允许递归的表称为递归表；相互关系：线性表∈纯表∈再入表∈递归表；广义表的特殊运算：1）取表头head(LS)；2）取表尾tail(LS) -generalized linear scale promotion. Generalized Table n elements is limited sequence elements can be atom or a generalized form, credited for LS. If the element is generalized table call the LS-table. If generalized non-empty table, the first one, said first table, and the remaining elements form Mei said. Table refers to the depth table contained in brackets after the start of the floors. Put the tree with the corresponding table called generalized pure form, which limits the list of ingredients sharing and recursive; To allow nodes to share the table as reentry table; Allow the table called recursive recursive table; Interactions : Table pure linear table reentry Table Recursive table; Generalized to the special operations table : 1) the first table head (LS); 2) the tail end table (L
Date : 2025-12-25 Size : 3kb User : wr
[Data structs] 传教士与野人问题 DL : 0: 传教士和野人问题是人工智能中的经典问题。本程序采用递归算法求解。定义一个函数，该函数返回一个解路径，路径可以用规则序列表示，也可以用状态序列表示。比如，用规则序列表示，可以表示为：（1 1）（1 0）。。。表示：过去1个传教士，一个野人，回来一个传教士，。。。如果用状态序列表示，可以表示为：（3 3 1）（2 2 0）（3 2 ）。。。路径用一个链表表示，该函数返回该链表。在main中调用该函数，并打印输出该路径。-missionaries and Savage is a classic AI problem. The program uses a recursive algorithm. Definition of a function, the function returns a solution path, the road rules sequences can be used, said the state can also use the sequence indicated. For example, the sequence with rules that can be expressed as : (1) (1 0). . . Said : In the past, a missionary, a Savage, a return missionaries. . . If the state sequence that can be expressed as : (3 3 1) (2 2 0) (3). . . Path with a linked list, the function returns the List. In a call to the main function, and print output of the path.
Date : 2025-12-25 Size : 33kb User : 罗鹏魁
[Data structs] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Date : 2025-12-25 Size : 10kb User : 罗鹏魁
[Data structs] BpNet_src DL : 0: BP神经网络源代码，代码详细设计了网络节点、迭代过程、及调用接口，在VC6.0下调用测试通过-BP neural network source code, code detailed design of the network nodes, iterative process, and call interfaces, in VC6.0 under test by calling
Date : 2025-12-25 Size : 5kb User : 刘胜国
[Data structs] Strassen_8 DL : 0: Strassn关于两个矩阵相乘的算法，同过分治原理把两个n*n的矩阵阶各分解成四个n/2*n/2阶的矩阵，当分解出来的矩阵阶数等于2时，求借各个小矩阵，若阶数大与2，就递归的调用前面方法，直到分解成2*2的子矩阵为止。-Strassn on two matrix multiplication, the algorithm, with the governing principle over two n* n matrix of the band decomposed into 4 n/2* n/2 bands matrix, the matrix decomposition order to 2:00, seek through various small matrix, if several big bands and two on the recursive call ahead, until decomposed into two sub-2* Matrix far.
Date : 2025-12-25 Size : 12kb User : 张斌
[Data structs] Family_tree DL : 0: 家谱用于记录某家族历代家族成员的情况与关系。现编制一个家谱资料管理软件，实现对一个家族所有的资料进行收集整理。支持对家谱的增加，删除，更新，统计等各项必须操作，并用计算机永久储存家族数据，方便随时调用。-genealogical records for a family history of members of the family and relationships. Preparation is a records management software, a family of all the information collected. Support for the family tree to add, delete, update, statistics and other necessary operations, and permanent storage of computer data family, convenience call.
Date : 2025-12-25 Size : 1.18mb User : Kong
[Data structs] ACKFunction DL : 0: 实现阿克曼函数并统计递归调用次数 Counting times of recursion calling 1．问题描述定义阿克曼递归函数： ACK(0,n)=n+1 n>=0 ACK(m,0)=ACK(m-1,1) m>=1 ACK(m,n)=ACK(m-1,ACK(m,n-1)) m,n>0 2．基本要求读入m、n，输出ACK(m,n)的值，并统计递归调用次数。-Ackermann achieve statistical and recursive function call Counting the number of times recur as contemplated by calling 1. Problem description definition of a recursive function Ackerman : ACK (0, n) = n 1 n
Date : 2025-12-25 Size : 574kb User : 李昭明
[Data structs] clonePtr DL : 0: a non-sharing smart pointer class that can be used with STL containers such as std::map, vector, list, set, and deque. The smart pointer has an assignment operator and greater than operator that call the target object s operator.-a non-sharing smart pointer class that can STL be used with containers such as std : : map, vector, list, set, and deque. The smart pointer has an assignment o perator and greater than operator that the call target object s operator.
Date : 2025-12-25 Size : 2kb User : 张建
[Data structs] DFSearch DL : 0: 数据结构（C＋＋版）的演示程序，详细演示深度优先搜索的具体调用过程,-data structure (C++ version) demonstration program, a detailed demonstration of the depth-first search to the specific call process,
Date : 2025-12-25 Size : 50kb User : znb
[Data structs] BFSearch DL : 0: 数据结构（C＋＋版）的演示程序，详细演示广度优先搜索的具体调用过程,-data structure (C++ version) demonstration program, a detailed demonstration of the breadth- first search specific call process,
Date : 2025-12-25 Size : 50kb User : znb
[Data structs] cstring DL : 0: 定义一个字符串类String，其私有成员为一个字符串指针。设计构造函数，拷贝构造函数，析构函数，设置新值函数Set, 打印成员值函数Print。借助此String类，将操作符＂＝＝＂、＂＞＂、＂＜＂的重载函数设置为String类的成员函数，实现对操作符＂＝＝＂、＂＞＂、＂＜＂的重载，使之能直接比较两个String类类型的字符串的大小，设计各种情况调用此三个重载操作符。-definition of a string type String, its private members as a string pointer. Design Constructors, the copy constructor and destructor function, install a new function Set, members of Print Print function. String through this type of operator "==",">", "" "Heavy function set to the String class member function, the operator realized "==",">", "" "heavy, so that it can direct comparison of two types of Class String string size, Design of various call this three heavy-duty operator.
Date : 2025-12-25 Size : 3kb User : gongwen
[Data structs] Hanoi_2 DL : 0: 汉诺塔的双递归调用，一样的原理，新的思路，新的算法。-HANOR double recursive call, the same principle, the new ideas and new algorithms.
Date : 2025-12-25 Size : 6kb User : 味精
[Data structs] riqi DL : 0: 自定义一个简单的日期类DateType，它具有数据成员y、m、d，用来表示当前日期的年、月、日。而后设计该类欲实现（完成）的功能，进而设计出相应的类成员函数。例如，下面给出的“雏形”可用来实现对天的增加，比较两个日期是否相等，以及对日期的输出等操作。请完成各类成员函数，并编制主函数，说明DateType类对象，对定义的各成员函数进行调用，以验证它们的正确性。 class DateType { //自定义的日期类DateType int y,m,d //数据成员，表示当前日期的年、月、日 public: DateType(int y0=1, int m0=1, int d0=1) //构造函数，设定年、月、日；并设置参数默认值 void incrementDay() //增加1天 bool equal(DateType dt2) //判断二日期是否相等 void printDate() //屏幕输出日期对象的有关数据（年、月、日） } -from the simple definition of a category DateType date, it has data members y, m, d, said the date for the current year, month, day. Then the design of such wishes to achieve (completed) function, and then design the class member functions. For example, the following is a "prototype" can be used to achieve the increase in the days to compare the same date. and the date of the export operation. Please complete the various members function, and the preparation of the main function, note DateType type object, definition of the members of the function call to verify their accuracy. Class DateType (//define the date category DateType int y, m, d// data members, said the date of the current year, month, day public : DateType (int y0 = 1, m0 = 1 int, int d002 = 1)// constructor fu
Date : 2025-12-25 Size : 4kb User : fisherman
[Data structs] erfenfa2 DL : 0: 非递归调用的二叉查找法：初始化一个数组，提示输入待查元素，返回查找的结果和查找次数-non- recursive call the binary search method : an array initialization, suggesting that the importation of unknown origin elements, return to the search results and the number of search
Date : 2025-12-25 Size : 1kb User : 刘莹
[Data structs] pet DL : 0: 演示类继承，派生的良好教程。可观察构造函数和析构函数的调用顺序，以及冲在构造函数时的参数继承顺序。-demonstration class inheritance, derived from the good guidance. Observed Constructors and Destructors function call sequences, and the structure-function of the parameters of the order of succession.
Date : 2025-12-25 Size : 1kb User : ghb
[Data structs] Call-and-order-one DL : 0: 调用与排序 1、编一个程序从一个文本文件source.txt中读入若干整数，用选择法将这些数据排成升序，将排序后的结果写入另一个文件文本文件target.txt中。注意两个文件均在d盘的data文件夹中。在程序运行前，先准备好输入数据文件source.txt，放入d盘的data文件夹中，内容可以如下：...... 程序运行结束后，查看d盘的data文件夹中的结果文件target.txt内容是否正确。 -Call and order one, compiled a program from a text file into a number of integers read source.txt, select the method with these data arranged in ascending order, sort the results will be written to another file in a text file target.txt. Note that two files are in d drive the data folder. Before the program runs, the first ready to enter the data file source.txt, d drive into the data folder, the content can be run as follows :...... After viewing the data folder d drive results in File target.txt content is correct.
Date : 2025-12-25 Size : 284kb User : 于慧斌
[Data structs] The-production-of-function-call-tree DL : 0: 文档是编程工作的一个非常重要的环节，它一般包括规格化程序清单、函数调用关系、变量参访表和程序结构等等。本文介绍了用ＢｏｒｌａｎｄＣ＋＋编程实现函数列表和函数调用树的自动生成方法，并详细分析了有关的数据结构和主要算法及技巧。-It is very important to make a document for programming work.Generally speaking,it includes standard program list,function call relation,variable reference list,program structure and so on.In the paper,a kind of method that produces function call tree and function list using Borland C++ is introduced.Some data structures,algorithms and technologies are analysed.
Date : 2025-12-25 Size : 167kb User : 李飞

« 12 3 4 5 6 »