国外一个计算机图形学课程的作业源代码，输入*.obj文件中的三角形网格，构造模型的半边数据结构，使用动态数组和哈希表，提取棱边并用opengl突出显示。-A half-edge mesh adjacency data structure is provided, along with a very simple .obj mesh parser. Throughout this code you are asked to consider the efficiency of various me

C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho

建立通讯录然后通过哈希表实现查找功能等，并且能解决冲突问题等-The establishment of contacts to achieve and then look through the hash table functions, and to resolve the conflict, such as