用邻接矩阵的形式实现了求有向图的强连通分量。

基于二叉树的图最有路径算法，在图能转化到二叉树表示时，可求解-the best path based on binary tree

Delphi编程练习：在数据库中以文件流形式保存JPEG图片。-Delphi Programming practice: in the database in order to document the form of preservation of JPEG image stream.

无线实时仓库管理系统 (ADO+ACCESS)-Wireless real-time warehouse management system (ADO+ ACCESS)

将数据从文本文件中按照规定格式装入INFORMIX数据库中，再从数据库中转出为文本文件并同时剔出相同号码-data from the text file format required load INFORMIX database and then transferred from the database to a text file and to get rid of the same number

这是一个魅力 xml c + + 解析器，如果您需要 xpath，请下载我的其他来源 （快速 c + + xpath 语法分析器）.in 代码 xmltest，这测试解析器，向您展示如何使用解析器。

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.

Caution tagging for live line works

oracle问题集，适合初学者-problem sets, suitable for beginners

最短路径 迪杰斯特拉 最短路径 迪杰斯特拉-Shortest Path Floyd Shortest Path Floyd

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list