库存管理系统使用 Powerbuilder 10.5

最小生成树，我自己做的小程序，很好用，希望和大家分享-Minimum spanning tree, my own little program, very good, and would like to share with

各种数据库语法，如 Oracle、DB2、Informix、MySql、Postgre-Syntax of various databases such as Oracle, DB2, Informix, MySql, Postgre

一个工程管理程序！我的毕业设计-a project management procedures. I graduated from the Design

这是一个数据结构常用的算法叫huffman编码.是对一棵二叉树进行huffman编码的算法-This is a common data structure called Huffman coding algorithm. For a binary tree for Huffman coding algorithm

一个很好的员工信息管理系统-a good staff information management system

这个是数据结构经典算法实现，是一些不错的算法-shu ju jie gou jing dian suan fa shi xian

一个使用射频卡的考勤软件-use of a radio-frequency card appraisal software

迷宫算法（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.

在线购物系统的完整代码。 非常好

八皇后问题解法,包括DFS,BFS和INF三种解法-8 Queen