售票处的服务系统

静态链表,c++语言描述，数据结构示范，模板类-staticlinnkedlist

离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve

一个用C++实现的B+tree程序源代码-b+tree implemented with c++

我写的那算法只是原理，要实用必须实现一个大整数类（用c++，我的算法是C的)。欢迎和我联系讨论-I wrote that the only algorithm principle, to be practical realization of such a large integers (with c, I C algorithms). And I welcome the discussion link

经典最短路径算法C C++ 邻接矩阵实现-Classic shortest path algorithm C C++ Realize adjacency matrix

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence

站长以前写的informix通用开发包源码，用c和ec编写-common code for infomrix,c and ec

简单介绍了一种数据结构的构建及其使用情况-introduces a simple data structure of the building and its use

我想要我的 soccerplay 团队在大学 geometry.h palayer.cpp,worldmodel 喜欢......pleaze 帮助我去此源免费获取某些利益来源

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees