Graph theory and network theory for the Dijkstra shortest path algorithm

大数相乘算法,使用C++语言在VC下实现.-large numbers multiply algorithm, the use of C language in the VC achieve.

题目：串基本操作的演示 含有测试结果和函数关系调用图-Title: string containing the basic operation of the demonstration test results and the function call graph

0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue

本桌面软件应用窗体，自定义菜单常用工具，数据表加密，树形控件等技术。新学者可以从中学习。人性化和个性化的界面设计，笑料十足，着实让人眼前一亮

一个进销存软件,便于管理仓库数据-a Invoicing software, manageable data warehouse

本程序用邻接矩阵实现图的深度优先遍历 图的广度优先遍历-the procedures used adjacency matrix of the plan is to achieve depth-first traversal of the plan breadth priority Ergodic

应用背景图书馆管理系统软件是用于监测和控制交易库。 ；图书馆管理系统是PHP MySQL主要集中在库中添加新成员的基本操作一样发达，新的书和更新信息，图书搜索、成员和设施，图书的借阅和归还关键技术图书馆管理系统的目的主要是提供图书馆自动化。用户提供的类别是：图书管理员：他可以读或写的任何成员的信息，可以更新，删除或创建一个会员计划。成员：他可以得到一本书。该应用范围广，可用于任何教育研究所，也可以在办公室使用的必要修改完成。有了这个应用程序，人工应用程序转换为自动在线应用。例如用途，定制的数据是用于此目的。用户将没有特权输入有关书籍的资料。在应用程序的三个主要组成部分：•登录•问题/借书•平衡费系统提供的解决方案是：•提供更好的和有效的服务•更快的信息检索减少图书馆工作人员的工作量本书的所有细节都可在点击•较少的文件工作和文件维护

从数据库中读取数据进行图形显示, 需要MSChart OCX。-Read data from the database for graphical display, the need for MSChart OCX.

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

统计学生成绩表中各分数段学生人数，用列表框返回结果。-Statistics of student achievement scores above table the number of students, using the list box to return results.