我编的学分管理程序,应用程序 原代码都有!VB入门的好东西

数据库监视备份软件te:应用程序例子(te.exe)-Bowl beat pacing视tong-de-sac glass figurines 软 te: Beckmannia email using the most序bird

这个项目是由 ms access 数据库注册系统组成。该数据库包含用户名、 密码、 名字和姓氏。该代码是在 vb.net 中。

数据结构中经典的约瑟夫环问题的解法。-data structure classic Josephus the solution.

最段路径算法C++实现 实现工程清晰可见 仅供参考-Most paragraphs path algorithm C++ Realize realize the project clearly visible for reference only

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

北京矢量电子地图shp格式，可用于GIS二次开发地图，如MapObjects，MapX等二次开发地图。-Beijing vector electronic map shp format, can be used for secondary development of GIS maps, such as MapObjects, MapX maps and other secondary development.

数据结构 习题-data structure Exercises

图的建立和图的广度深度优先遍历（有向图和无向图）-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)

迷宫算法程序学习，数据结构里的经典学习程序，代码经过自己的优化，加快了搜索速度-maze procedures learning algorithms, data structures of classical learning process, by its own code optimization to speed up the search process

迷宫问题。以一个 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)