资源列表
DijkstraTest
- Dijkstra算法及demo实现，目前10万点,20条边，平均搜索时间为3.7秒.-Dijkstra algorithm and the realization demo now 100,000 points, 20 edges, the average search time of 3.7 seconds.
prog1
- 此代码展示了Euler计算方法与差分方法-This code demonstrates Euler difference method and calculation method
prog3
- 此代码展示了Euler计算方法与差分方法-This code demonstrates Euler difference method and calculation method
prog4
- 此代码展示了Euler计算方法与差分方法-This code demonstrates Euler difference method and calculation method
prog5
- 此代码展示了Euler计算方法与差分方法-This code demonstrates Euler difference method and calculation method
haha
- 牛顿迭代法 需要的同学尽量来拿吧 不要钱-Newton iteration needs of students as far as possible it should not来拿money
simple-kalmanf
- 这个程序实现了最简单的Kalman滤波算法，最重要的是含有丰富的注释，足以让一个入门的人理解。-This process to achieve the most simple Kalman filter algorithm, the most important thing is rich in notes, enough for people to understand a single portal.
3
- 多元哈夫曼算法，用贪心算法求解石子合并的最优解-Multi-Huffman algorithm, greedy algorithm with the optimal solution of the stones combined
car
- 使用动态规划算法求解汽车加油问题，求得费用的最小值，-The use of dynamic programming algorithm to solve the issue of motor vehicle fuel to obtain the minimum cost,
exBFS
- 八数码，是经典的ACM题目中， 采用BFS的例子-Eight digital, ACM is a classic topic, using the example of BFS
juzheng
- 实现稀疏矩阵转化为三元组，并且进行转置以及其他运算。-The realization of sparse matrix into a triple, and home to turn, as well as other operations.
homework1
- 刚才邮箱写错了 幂法反幂法程序作业 带LU分解子程序 DOLITTLE分解法等-Just wrong-mail anti-power-law power-law procedures for operating with LU decomposition subroutine Dolittle decomposition method, etc.