Simulation-of-dendritic-growth

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

c++用栈来实现迷宫求解（c语言数据结构）(c++ stack maze solving (c language data structure))

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)

使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)

求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )

数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

设计一个表达式求值的程序。该程序必须可以接受包含（，），+，-，*，/的中缀表达式，并求出结果。如果表达式正确，则输出表达式的结果；如果表达式非法，则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)