实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径...

自己学VB时数据库编程的一个小程序-studied VB Database Programming a small program

线性表（顺序存储）结构与功能的简易实现，本代码采用C++实现，仿照C++中的容器类，将该线性表封装成了一个使用的多功能类。

PB9.0生成的图书管理系统，该系统包含读者管理和图书管理两部分，能完成图书借阅的基本功能。后缀为db的是数据库文件-PB9.0 generated library management system, which includes management and library management readers in two parts, to complete the basic functions of books to borrow. Db suffix to the database file

很多的vb经典源代码-many classic vb source code

中文Access 2000 24学时教程(PDG)-Chinese Access Guide 2000 24 school (PDG)

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

大学学籍管理系统-University Academic Information Management System

VB为前台，SQL_SERVER为后台的关于宾馆的数据库编程-prospects for VB, SQL_SERVER background on the hotel Database Programming

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.

你好，它如此使用...... #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 >......甚 & 更多