一个简易的ACCESS的源程序 VB源码

经典的哲学家就餐问题的C语言版本-Power wilt die of hunger laugh mold cavity open string问Questions cavity C Pang Sung-linked版

图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such as the shortest path to map the way! VC interface!

将图片数据全部放在了数据库中，利用OLE对象的存储方式-All the picture data on the database, the use of OLE object storage

清华版数据结构代码实现-Qinghua version code data structure to achieve

递归算法求统计二叉树T中叶子结点的数目，数据结构常用算法-recursive algorithm for statistical binary tree T leaf node of the number of commonly used data structures Algorithm

奇妙的二叉树.rar 里面对数据结构里的二叉树进行了非常详细的说明,对大家学习数据结构有非常大的好处-wonderful binary tree. Rar inside of the data structure, the binary tree for a very detailed description of the data structures you learn a lot more benefits

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

这是一个程序集级程序，以接收来自另一个 microcrontroller 的并行端口数据。它储存在暂存器。这些数据是时间标记和中继到 PC 串行端口上。该代码使用中断使并行处理成为可能。已测试和用于应用程序的代码。此代码将讨论两个主要 issues:(a) 时间 tagging(b) 平行于串行转换。

从库中调用图片(10KB) 从库中调用图片(10KB)-Picture from the library call (10KB) picture from the library call (10KB)

共有4个数据结构的实例-a total of four examples of the data structure