MS ACCESS 数据库文件的压缩 Delphi 实现

非常典型的递归算法来获得指定的文件夹大小。Win案例中使用API Findfirst FindNext完成。

根据图书管理的功能要求，结合学校图书管理的实际情况，系统分成以下若干模块：编目、典藏、流通、读者、查询、系统维护。-According to the functional requirements of library management, combined with the actual situation of the school library management, the system divided into several modules: cataloging, collection, circulation, reader, search, system maintenance.

51aspx源码必读.txt   dianyingyuan.sln   ............AbouForm.cs   ............AbouForm.Designer.cs   ............AbouForm.resx   ............inDebugone.jpg   ....................dianyingyuan.exe   ....................dianyingyuan.pdb   ....................dianyingyuan.vshost.exe   ....................gongfu.jpg   ....................lost10-001-3.txt   ....................lost10-001-4.txt   ....................lost10-001-5.txt   ....................lost12-001-4.txt   ....................lost8-001-3.txt   ....................lost8-001-4.txt   ....................Sava.txt   ....................ShowList.xml   ....................spiderman3.jpg

图论中得kruskal 算法 求解最小生成树 算法为图论中得经典算法 -In graph theory a Kruskal algorithm for minimum spanning tree algorithm in graph theory a classical algorithm

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

建立、使用二叉树的程序，内含源程，是数据结构中必学知识。-established procedures for the use of binary tree, the source of intron way, the data structure is certainly knowledge.

本程序是以图形化，慢动作显示经典棋盘覆盖算法问题。-This procedure is based on graphical, slow-motion show the classic board covering algorithm problem.

旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.

powerbuilder

Video rent program. simple