最短路径的具体实现，使用了dikstra算法

这是一个网络数据库回调例程,基于SocketConnection的-This is a network database callback routines, based on the SocketConnection

魔王的语言，运用了数据结构栈、队列的结构-Devil" s language, the use of the data structure stack, queue structure

多线程进行二分排序法，递归产生新线程，每一个父线程产生两个子线程，接着父线程对两个子数组进行合并-Multi-thread two hours sorting method, recursive generate a new thread, each thread is a parent produces two sub-threads, then the parent thread to merge the two sub-arrays

数据结构（Java语言版）-data structure (Java version)

图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.

求解网络中的最短路径。假设某个计算机网络有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.

用C++写的寻找公共祖先，实现树的先序后序中序层次遍历，内有实验报告可以参阅。-C wrote for the public ancestors, the first realization of the tree sequence after sequence traversal sequence level, there are experimental report can be found.

关于数据库的源代码。适合初学者参考如何使用数据库。-With regard to the database source code. Suitable for advanced users how to use the database.

这是数据结构的四则运算的c语言程序，只要编译就能运行呀！-This is the data structure of the four operations c language program, as long as the compiler can run!

数据结构课本对应算法的程序实现，初学者有一定的帮助，包括一些常见的算法的程学实现。-textbooks data structure corresponding algorithm program, beginners will help, including some common-learning algorithm to achieve.