student performance management system software, the results of the students on v...

该程序完成对二叉树的非递归中序遍历，因为其中涉及到二叉树的构造，而且使用类来构造，所以代码比较多。-completion of the process of non- recursive binary tree which preorder because it involved the construction of a binary tree, but the use of class structure, the code more.

Magio牛的usaco源代码，希望和大家共同学习-Magio cattle usaco source code, hope and common learning

应用背景可实现交通路线的最优路线；修建主干道路的设计路线；修建网络主干的最优路线等等都可以通过最短路径算法实现关键技术从某个源点到其余各顶点的最短路径，其中有按长度递增的迪杰斯塔拉算法，带权的迪杰特斯拉算法能有效的实现最短路线的设计

图的应用-铁路最短路径的源码以及实验报告！-Diagram- railway source shortest path, as well as experimental reports!

以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan

完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal

能够运行的c调用sqlite的程序1，适合学习sqlite-Be able to run sqlite in c call one of the procedures for learning sqlite

本文以制作一个《论坛》为例，简单地介绍了delphi 2005 的B/S程序设计方法。数据库：SQL 2000，编程：delphi 2005 ARCHITECT-paper for the production of a "forum" for example, to brief the delphi 2005 B/S process design methods. Database : SQL 2000, programming : delphi 2005 ARCHITECT

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

ODBC API访问数据库的文章却少之又少。虽然用ODBC访问数据库比较麻烦，但却很灵活，效率高，-ODBC API to access the database of the article are few and far between. Although access to the database using ODBC is too much trouble, but it is very flexible, high efficiency,