门到门蔬菜服务

有向图 编写程序判断该图是否含有环 如没有则输出其拓扑序列-Digraph write a program to determine whether it contains any part of the plan if there is no sequence of the output of its topological

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.

Linux下的操作oracle数据库的连接库-Linux operating oracle database library

数据结构课程的作业，代码通俗易懂，且运行效率高。-Data structure course work, the code easy to understand, and operating efficiency.

数据结构的一个试验，是一个多项式的运算，里面封装了，链表的操作，堆栈的操作等常用的数据结构，适合初学者-data structure of a test is a polynomial arithmetic inside a package, Chain operation, the operation of stack common data structure, suitable for beginners

Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm

二叉树的先序，中序，后序，按层遍历算法。以中序输入，用‘#’代替叶子节点的子节点输入。-binary tree first sequence, sequence after sequence, layer by traversal algorithm. The order to import, use "#" instead of the leaf nodes for input nodes.

程序展示了C++程序的现代设计模式。设计模式是重用设计解决方案的方法

这是一个有关于VC++6.0与数据库ACCESS相结合的小程序-This is a database on the VC++6.0 with a combination of small programs ACCESS

Java 检测 distruibuidos 数据库, PHP 执行情况