adapt the DP to solve the common longest strings(two and one dimension array)

一些数据结构源代码-some data structure source code

四色算法代码，已经在OMNETPP平台上编译成功！-Algorithm for four-color code has been compiled successfully OMNETPP platform!

用c实现的二叉树的中序遍历的读取与存储，能体现出向左倒的二叉树的打印界面，界面简单。-achieved using the binary tree traversal sequence which read and storage, will be shown left one of the binary tree Print interface that simple.

树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a complex point.

有关于二差树的遍历，对于初学者有很大的帮助，-Worse on the second tree traversal, for beginners there are a lot of help,

用C实现的基于O-tree的ic设计布图布线工具源代码,有相关文档-C realized based on O-tree-id wiring layout design tools source code, related documentation

算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared

这是一个数据结构的常用算法,是关于字符排序的,输入一串字符用算法实现字符排序-This is a common data structure algorithms, is the sort of character input string of characters with character Sort Algorithm

八皇后问题，回溯算法的经典例子，此程序可以扩展至n皇后问题。-eight Queen"s problems, backtracking algorithms classic example of this procedure can be extended to n Queen"s problem.

最短路径2 是有关数据结构的知识 但是程序稍稍有一个小小的失误-Shortest Path 2 is the data structure of knowledge but the procedures are a little bit errors