智能仓库管理系统

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

本文介绍如何使用一些sql操作符

VB与sql数据库的完美结合实例1-sql database VB and the perfect example of a combination

大整数的四则运算,搞ACM时丰常常用,我当时是屡试不爽,传上来大家分享-Large integer arithmetic, ACM engaged in abundance are often used when, I was applied successfully, Chuan-up to share

ADO使用和封装的例子，很实用-ADO use and Packaging example, a very practical

用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree

数据结构的课后练习-Data structure of the after-school practice

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of

力控组态软件和extremedb实时数据库接口-ForceControl configuration software and real-time database interface eXtremeDB

自己设计的一个简易的考勤管理系统，所使用的数据库为acce-a simple time and attendance management system，using access as database system