LINK

c++ data struct stack

数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)

中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)

图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书(yrteryryer)

dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)

数据结构的一些简单的排序算法，有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)

具有数据插入、修改、删除、显示、和查询功能的电话簿管理程序。 数据包括：人名、工作单位、电话号码、和E-mail地址。 可对记录中的姓名和电话号码进行修改。 可增加或删除记录。 可显示所有保存的记录。 可按人名或电话号码进行查询。 附加功能： 可修改单个记录的各项内容。 可重新建立电话簿。 可按人名或号码进行排序。 可统计名片数目及可再添加数目。 可插入单个名片并不破坏原有顺序(With the data to insert, modify, delete, display, and query functions of the phone book management program. The data include: the names, work units, phone number, and E-mail address. Can be modified to record the name and phone number. Increase or delete records. You can display all the records kept. According to the names or telephone number for queries. Additional features: you can modify the content of a single record. Can re-establish a Phonebook. According to the names or numbers to be sorted. Statistical card number and add the number. Insert a single card does not destroy the original order)

这是一个实现找出欧拉路径的的算法，比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)

匈牙利算法以及指派问题介绍，kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)

根据最常用的链表法进行huffman编码，可以手工预制权重，例如n=8的时候即可以在文件中写入，输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)