二叉树的先序遍历，使用栈实现（构造空栈，初始化栈）

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

操作系统――进程调度算法实现 本程序主要实现了进程调度中最常见的优先数算法和轮转时间片算法。-operating system-- the process of scheduling algorithm to achieve the main procedures of the process of scheduling priority to the most common algorithms and several Web-time algorithm.

后缀数组的一个C++实现，在字符串统计中有很大作用。-Suffix array of a C++ implementation, plays a significant role in statistics in the string.

数据结构C++代码-data structure C code

数据结构 银行程序-data structure banking procedures

这是求职者可找在线招聘管理系统。每位求职者将登录到事故帐户和更新他他可以创建他的简历的信息。他会申请这份工作。可以搜索多个工作。管理员将看到求职者已经申请了这份工作的所有列表。他可以看到他们的个人资料，可以招募他们。为招募他要召唤他们的采访。他将给招聘者发送电子邮件。自动化的电子邮件将被创建并发送给求职者。电子邮件中包含的时间面试和作业的详细信息。

数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).

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

ADBMS document for procedures and triggers

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)