数据结构源码1000例

floyd，求最短路径的算法。。求任意两点间的最短距离-floyd, seeking the shortest path algorithms. . Arbitrary order of the shortest distance between two points

用VC++6.0开发多表联接的数据库应用程序-VC 6.0 multi-table database connectivity application

计算机算法设计，用于设计贪心算法，你们懂得-Computer algorithms designed for the design of dynamic programming, you know

能够输入节点 然后完成图的广度优先遍历-Able to enter the node and then complete the graph breadth-first traversal

我们在学习外省市先进经验的基础上，结合教材管理工作实际情况和多年的工作经验，组织了专门人员与协力电脑公司利用Vb6.0程序语言和SQL数据库语言共同开发研制了“河北广播电-we learn advanced experience of other provinces and cities on the basis of materials management with the actual situation, and many years of work experience, organized with the help of specialized personnel computer companies use Vb6.0 programming language and SQL database language jointly developed "Hebei Radio

数据结构算法，稀疏矩阵的存储，两矩阵相乘，两矩阵相加的实现-data structure algorithms, sparse matrix storage, two matrix multiplication, the sum of two matrix to achieve

这是我自己写的从数据库中读出数据，并显示，并构成不规则三角网的程序，可以在程序中添加约束线。-This is written in my own读出数据from the database and displays, and triangulated irregular network constitutes the procedure, you can add a constraint in the procedure line.

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

《数据结构与程序设计》书本所有源代码-" Data Structure and Program Design" books of all the source code

匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.