-
BresenhamLine
在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)
- 2012-06-03 18:21:13下载
- 积分:1
-
bag1
使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
- 2011-07-16 18:40:31下载
- 积分:1
-
adms
阿当姆斯显式和隐式求解方法,用四阶龙格库塔作为起始,然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中,方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)
- 2012-06-09 11:27:18下载
- 积分:1
-
neu_SSD
东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)
- 2016-06-30 16:12:38下载
- 积分:1
-
cPP
数据结构课设,城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
- 2011-07-03 11:58:24下载
- 积分:1
-
DP
说明: 动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)
- 2012-11-12 08:52:31下载
- 积分:1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分:1
-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分:1
-
test
使用vc编写的一个动态链接库,测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
- 2010-05-28 23:27:09下载
- 积分:1
-
fibonacci-heap
斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
- 2013-09-17 18:02:59下载
- 积分:1