资源列表
3
- 数据结构栈操作，包括进栈、出栈等操作。学数据结构的同学记得评分哦
AddOperator
- 用C++编写的复数加法重载，输入复数可计算加和值。供参考！
fibonacci_2
- 本程序是用备忘录法实现计算斐波那契数列，大大缩短了运算时间。
matrix_calc
- 求出M阶矩阵2~N次，并且可以把1~N次的值相加-M-order matrix obtained 2 ~ N times, and can be put 1 ~ N times the value of the sum.
hanoibfs
- 用广度搜索编的汉诺塔问题，能解决14个盘子的，用到位运算压缩判重，用哈希表判重。-The Tower of Hanoi with the breadth of search code problem, can solve the 14 dishes, with a compression sub-re-place operations, using the hash table sub-weight.
p1
- 影像處理，使用OPEN CV語言做處理，內有詳細程式碼，請自行參考-Image processing, the use of language to deal with OPEN CV, with detailed code, please refer to their own
tree_traverse
- 二叉树遍历,包括二叉树的创建，插入，删除-Binary tree traversal, including the creation of a binary tree, insert, delete
Newton
- 实验题目：Newton插值多项式 相关知识：通过n+1个节点的次数不超过n的Newton插值多项式为： 数据结构：两个一维数组或一个二维数组 算法设计：（略） 编写代码：（略） 实验用例： 已知函数y=f(x)的一张表(同上一个试验) 试验要求：利用Newton插值多项式 求被插值函数f(x)在点x=65处的近似值。建议：-Experiment Title: Newton interpolation polynomial Knowledge:
Havel-Hakimi-Theorem
- 此代码是图论Havel-Hakimi Theorem的实现，用于解决给出点集的入度数，判断一个图是否连通图-This code is shown in Figure On the implementation of the Havel-Hakimi Theorem, for solving the given point set into the degree to determine whether a graph connected graph
KnightMove
- 对于骑士走步问题的回溯法实现，具体的问题描述可以上网查询，此处主要给出具体的实现代码，如有不便敬请谅解-For backtracking method to realize the knight move problems, specific problem descr iption can go online inquiry, the main specific implementation code, if there is any inconvenience locations
e8.28
- 实体力筋法的三种模型示例，力筋线形为直线加圆曲线加直线形式-Three models Examples of entities tendon law, tendons linear linear acceleration circular curve plus a straight line