我们数据结构课上的一些作业 包括约瑟夫环和哈夫曼树之类的几个程序...

我的数据结构的实验题，停车场，用栈和队列 模拟停车场，实现进车和出车-my data structure experiment, a car park, with Stack and Queue simulated car parks, to achieve progress and out of cars

资源描述数据结构课后题，图方面的代码，如DFS BFS dijistra prim kruscal等,对于初学算法基础课的学生有很大的帮助

企业管理系统,包括工资人事等.基于VB 设计-Enterprise Management System

vfp表单，锁住和解锁数据表。（压缩文件）-Probe form, the lock and unlock data sheets. (Compressed files)

三级网络技术上机题答案-three-network technology that answers

包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等-includes various tests, such as search and algorithm code, such as Bubble algorithm, the tree traversal, linked list, queue, stack, etc.

java程序实现的通俗易懂的二分查找的算法源代码-java program to achieve the user-friendly dichotomous search algorithm source code

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

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

PB中的PFC使用例程，包含精简PFC类库-PB PFC use routines, including streamlining the PFC