-
code
C++实现的两类问题随机森林生成算法,对学习随机森林很有帮助(Source code for random forests,wanderful codes,and help youself to it!)
- 2020-06-29 22:20:02下载
- 积分:1
-
deep-copy
该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分:1
-
permutations
组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
- 2011-12-12 10:51:16下载
- 积分:1
-
BFS
迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
- 2013-12-26 22:08:58下载
- 积分:1
-
Prim
编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。
(其中随机生成点和边,形成连通图)
根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分:1
-
calculation
数据结构计算算术表达式算法,可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)
- 2010-12-24 13:11:25下载
- 积分:1
-
ds3
单向链表的创建与操作
设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作:
(1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。
(源代码:ds3-1.c)
(2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。
(源代码:ds3-2.c)
(3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。
(源代码:ds3-3.c)
(4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。
(源代码:ds3-4.c)
(5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。
(源代码:ds3-5.c)
(6)在给定的单链表的第i位上插入值为n的节点。
(源代码:ds3-6.c)
(7)在给定单链表的值为m的节点的前面插入一个值为n的节点。
(源代码:ds3-7.c)
(Creation and operation of a one-way linked list
Set up a one-way linked list data type node integer data fields , write a function to achieve the following:
( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user .
( Source : ds3-1.c)
( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address.
( Source : ds3-2.c)
( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node .
( Source : ds3-3.c)
( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 .
( Source : ds3-4.c)
( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 .
( Source : ds3-5.c)
( 6 ) )
- 2014-05-11 19:19:41下载
- 积分:1
-
Insert
POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)
- 2013-11-21 23:27:17下载
- 积分:1
-
labyrinth
迷宫问题c源代码,大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标,输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)
- 2010-12-19 23:31:36下载
- 积分:1
-
npxkcsj
数据结构课程设计,多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)
- 2010-07-07 07:34:56下载
- 积分:1