tcpip

the longest common serials

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)

清华大学出版社，数据结构简明教程李春葆著，第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)

说明：  分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion )

数据结构之队列，完整可运行的一个程序，包含队列的各种操作。(no)

任务：实现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.)

用从语言实现飞机订票系统。程序中用到了数据结构中的队列和栈。(From the language used airline reservation system. Process the data structure used in the queue and stack.)

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)

讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)