使用数据解构编写的公交换乘系统！可以按路线查询！使用数据解构编写的公交换乘系统！可以按路线查询！

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing

our homework big project

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

Co oporate banking.is 不错的银行体系已写下 c + +.developed 由一组称为 ASN 在加纳......在 2013年 7 月中午，已投放市场

本文一方面以实例的形式介绍产生数据封锁的各类情况，另一方面从数据库理论的角度加以分析，以期使读者既知其然，更知其所以然，使读者能够更加深入地理解Oracle的数据封锁机制，而不是简单地记住某些结论。-In this paper, on the one hand, to produce the form of examples of the types of data on the situation of the blockade, on the other hand, the theoretical point of view from the database to be analyzed in order to make the reader not only know-and know所以然, so that readers can be more in-depth understanding of Oracle data blockade mechanism, rather than simply to remember some of the conclusions.

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

数据结构课程设计，求无向网最短路径，利用c++6.0编程环境-data structure curriculum design, without seeking the shortest path to the net, using c 6.0 programming environment

一个通讯录――――――利用C++实现的，非常不错哦-Address Book- C++ implementation

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a