搜索资源列表
maze
- 电子老鼠迷宫：输入起点坐标和终点坐标（最小为1 1，最大为12 12），以及一个20*20的迷宫（“.”表示通道，否则就是墙），就能找出到终点的最短步数。-E-rat maze: Enter the starting point coordinates and end coordinates (minimum of 1 1, a maximum of 12 12), and a maze of 20* 20 ( " ." Said the channel, otherwise,
TextureSynthesis
- 基于块拼接的纹理合成算法实现，在最小误差路径切割时做了修改，在重叠区域寻找回溯点再同时向下和向右寻找切割路径-Splicing block-based texture synthesis algorithm, the minimum error path of the cutting was revised, in the overlapping area at the same time looking for back points and then cut down and find th
CoverageGA
- This an algorithm that finds the optimal coverage of wireless sensor networks and maintains connectivity between sensor nodes. However, it did not find the minimum number of active sensor nodes.-This is an algorithm that finds the optimal coverage of
Sjx.java
- 编写一个三角形类，能根据3个实数构造三角形对象，如果三个实数不满足三角形的条件，则自动构造以最小值为边的等边三角形。输入任意三个数，求构造的三角形面积。-Preparation of a triangle class, according to three real objects constructed triangle, if the triangle does not meet the three conditions of a real number, is automatically
CalculateTheSummary
- 1． 编写一个程序打印数出有10个元素的浮点数组a1中最大值和最小值。 2．将有10个元素的数组a1 拷贝至含有15个元素的数组b1的一段位置。 3．将一个已存入数组中的值45，89，7，6，0，按0，6，7，89，45的次序打印出来。 4. 求一个3*3矩阵对角线元素之和。 5．设某个一维数组中有25个元素，编写一个顺序查找程序，从中查找值为80的元素在数组中的位置。 -1. Write a program that prints out a number of floa
Andian
- /** * 二维数组的鞍点 * （行上最大，列上最小） * 思想：先找到每行上的最大值，保存在一维数组上b[i]。 * b[0]对应的那列最大值的行号为0， * b[1]对应的那列最大值的行号为1 */-/**** Two-dimensional array of the saddle point (the line' s largest and column minimum)* thinking: first find the maximum on e
java
- 编写程序，从键盘获取6个整数，从中找出最大的和最小的，并输出。-Write a program to get six integers from the keyboard to find out the maximum and minimum, and outputs.
ArrayInput
- 个人原创代码：编写Java Application程序， 从命令行参数输入10个整数并保存在数组中，求数组中最大、最小、数据的和、平均值。-Personal original code: write a Java application program, enter 10 integers from the command line parameters and stored in the array, find an array of maximum, minimum, data and av
print
- In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The algorithm attempts to find subsets which are common to at least a minimum num
elsisds-document
- In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The algorithm attempts to find subsets which are common to at least a minimum num
newJava
- 十个经典Java编程算法（判断是否是素数，求最大公倍数和最小公约数等等）-The ten classic Java programming algorithm (to determine whether it is a prime number, find the greatest common multiples and minimum divisor)
gSpan
- gSpan is a software package of mining frequent graphs in a graph database. Given a collection of graphs and a minimum support threshold, gSpan is able to find all of the subgraphs whose frequency is above the threshold.
maxormin
- 输入几个数然后比较这几个数的大小找出其中最大和最小值。-Enter a few numbers and then compare these numbers to find out where the size of the maximum and minimum values.
Apriori-
- Apriori算法是R.Agrawal和R.Srikant于1994年提出的为布尔关联规则挖掘频繁项集的原创性质算法。正如我们将看到的，算法的名字基于这样的事实：算法使用频繁项集性质的先验性质。Apriori使用一种称作逐层搜索的迭代方法，k项集用于探索（k+1）项集。首先，通过扫描数据库，累积每个项的计数，并收集满足最小支持度的项，找出频繁1项集的集合。该集合记作L1。然后L1用于找频繁2项集的集合L2，L2用于找L3，如此下去，知道不能在找到频繁项集k项集。找每个Lk需要一次数据库全扫描。-
java
- 有一个5行6列的二维数组，元素值array[i][j]=iˆ 2-(j-i)ˆ 2+10, 其中,0<=i<=4,0<=j<=5,输出该数组，并求出每一行的最大值和每一列的最小值。-A 5 rows 6 columns two-dimensional array element value array [i] [j] = i2-(ji) 2+10, where, 0 < = i < = 4,0 < = j < = 5, the output
AccountManager
- 编写一个账户管理类AccountManager，使用映射容器管理账户，其中以字符串表示的账户名是键对象，而以前编写的类Account是值对象。类AccountManager应该具备开设账户、删除账户、通过户名查找账户余额、列出所有账户、清除余额小于1元的账户、统计所有账户的总余额、查找最大余额和最小余额的账户等功能。 - Write an account management class AccountManager, using the mapping container-manage
IntervalTree
- 对区间树进行插入，并找到低端点最小重叠区间-Insertion of interval tree, and find low-point minimum overlap interval
Searchsushu
- 查找1000以内的素数，在屏幕上显示出来，采用最少循环次数的算法-Find primes less than 1000, is displayed on the screen, with a minimum number of cycles of the algorithm
JAVA
- 1百分制分数到等级分数 2成法口诀阵形 3华氏和摄氏的转换法 4三个数的最大数 5简单计算器的小程序 6三角形图案 7输出输入的姓名 8一小时倒计时小程序 9棋盘图案 10数组输出唐诗 11找出满足条件的最小数 12判断一个数是否是素数 13一个数倒序排列 14将一个整数以二进制输出 15矩形图案 16猜数字 17.Ho
tree
- 采用数据结构里的邮箱图的最小生成树算法,实现查找一棵最小生成树的算法-Using the mailbox in the data structure diagram of the minimum spanning tree algorithm, to find a minimum spanning tree algorithm