erchashu

二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)

8_queen问题的一个自创的算法，还不错！(8_queen)

线性表的链接实现可利用单链表来实现，每个节点存储一个元素。 利用单链表来实现线性表的元素的插入，删除，修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

POJ141的源代码，以空间换时间，速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

说明：  约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)

任务：实现Dijkstra算法 工程名：Project_ShortestPath 要求：实现Dijkstra算法，算法主体写在CGraph类中；要求是从command窗口中输入源节点编号，并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注：要输出整条路径，而不仅仅是前一跳，也不允许逆序输出。 (Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)

这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)

选择型结构c语言编程 (Choose the type of structure of C language programming)