数据结构中最小生成树的C语言实现源代码，需要的可以下载，只适用于初学者。...

稀疏矩阵的十字链表算法-sparse matrix algorithm Cross Chain

ODBC数据源注册小工具，简化数据库连接-ODBC data source registered a small tool to simplify database connection

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

北航《数据结构》PPT,内容详细，逻辑感强，适合自学-Beijing Institute of Aeronautics " data structure" PPT, and detailed, logical sense, good for self-study

求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest path. Assuming a computer network n site, followed by No. 1, 2, ..., n; Some sites have direct connections (that is, between two sites are no other site), and some sites have no direct connections. If three yuan (i, j, f) to the network said the site j site and I have direct connections between them but the distance of f the network known as the site of the direct link between the situation by 3 m (i1, j1, f1), ( i2, j2, f2), ..., (im, jm, fm) to determine, calculate requirements for a network site arbitrary g (1 g n) of the rest of the site is the shortest distance.

求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 在运行程序之前，请将所附的数据库文件dms.mdb添加为数据源，并命名为DMS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 before running the program, please attached the database file for the data source to add dms.mdb named DMS

我从网上下载的vc编的odbc源程序。他作为我的学习资料，希望对大家有用。-I downloaded from the Internet made the odbc source vc. Him as my learning materials, in the hope that useful to everyone.

数据库设计60个技巧-Database design skills 60