非常好的来源。学习数据库的访问。一个详细的说明…

本系统为内部系统，帐户由管理员添加、管理； 分为两个组，User组和Boss组。Boss组的帐户可以发广播通知； 任意两个用户间可以互相通信； 数据库接口用DAO，网络通信用 CSocket+CSocketFile；-the system to internal system administrator account by adding, management; Divided into two groups, User Group and the Boss group. Boss Group accounts Broadcasting notice can be issued; Between any two users can communicate with each other; Using DAO Database Interface, Network Communication CSocket CSocketFile;

软件工程专业 数据库系统课件及习题 大二的课程-Software Engineering Database System and the Problem sophomore curriculum courseware

本模拟考试系统设计考生登录及考试界面模板，各模块的功能能具有考试的各个功能，本系统采用了VB。net2008作为开发工具，后台采用了SQL server2005数据库-Examination of the simulation system design and test candidate interface template registry, the functions of each module can have various functional tests, the system uses the VB. net2008 as a development tool, the background database using SQL server2005

单源点最短路径算法 * 本程序用来实现单源点最短路径（E.Dijkstra）算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * 每条边的两个顶点和权值由用户输入，格式：1 2 20 * 程序默认源点为第一个顶点 * 算法完成后输出路径长度和路径上的顶点 * 格式为：路径长度：目标顶点

你好，它如此使用...... #include < iostream > #include < stdlib.h >...甚及更多 #include < stdlib.h >...甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >...甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >......甚及更多#include < stdlib.h >...甚及更多#include < stdlib.h >......甚及更多#include < stdlib.h >...甚及更多#include < stdlib.h >......甚 & 更多

货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path

按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度-by creating a binary tree traversal sequence, and which preorder binary tree, seeking binary tree height

数据结构底层经典算法――时间陷阱，请大家参考-underlying data structure classical algorithm-- time trap, please refer to

树的建立算法和树的遍历操作。。。下载解压即可-The establishment of trees and tree traversal algorithm to operate. . . Download decompression can

数据结构课本的算法，自己独立编写，配套教材严蔚敏，清华大学出版社。声明：未经本人许可，禁止用于商业和不法用途。本作者对本代码保留所有权利。-Data structures textbook algorithms, their own independent writing, supplementary materials, Yan Wei-Min, Tsinghua University Press. Statement: without my permission is prohibited for commercial and illicit purposes. The author of this code All Rights Reserved.