资源列表
my_BFS
- 1. Enqueue the root node. 2. Dequeue a node and examine it. * If the element sought is found in this node, quit the search and return a result. * Otherwise enqueue any successors (the direct child nodes) that have not yet been discovered.
shadar_gurav
- Shadar 3 open source. Matrix multiplication
toposort1
- 用C++语言实现拓扑排序算法，但只能找到一个拓扑排序-topological sorting arrangement
hfm
- 哈夫曼树的实现 哈夫曼树的实现-Implementation of the Huffman tree
av_vel
- c语言编写的一个程序，用于计算平均流速用以修正防穿透速度。 -The average flow rate used to calculate the penetration rate for the modified anti-
address
- 可以完成相关炼油厂的选址问题，确定其地址，他利用VC+6编写的-Complete the related refinery site to determine the address, he used VC+6 write
Sort_merge
- 两个已经排序好的链表进行归并排序为第三个新的链表，有序 -Two merge sort to sort good list third new linked list, ordered
GuangyiErChaShu
- 由广义表形式的输入建立二叉链表,用递归算法实现的，很有参考价值 -Establish generalized the form of input binary list recursive algorithm of great reference value
Insert
- POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中-POJ string can be inserted into a length of string into a string before being given
K1
- hanoi塔经典问题，采用递归算法,值得研究研究-Hanoi tower classic, using recursive algorithm, it is worth studies
C++
- 用C++语言编写的链表操作程序,可以实现链表的基本操作:头插法建立单链表,尾插法建立单链表
01beibao
- c++中运用动态规划解决01背包问题可以运行，有汉字说明-c++ using dynamic programming to solve the knapsack problem can run 01, with characters that ~ ~