登录
首页 » Visual C++ » qiongju

qiongju

于 2013-08-14 发布 文件大小:1KB
0 202
下载积分: 1 下载次数: 3

代码说明:

  八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • DBSCAN
    数据挖掘中聚类算发中基于密度的算法DBSCAN(Hair count data mining clustering algorithm DBSCAN density-based)
    2011-09-29 09:53:45下载
    积分:1
  • Work3.5
    上海交通大学数据结构课程的课后作业系列3.5:仅供参考,最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
    2013-12-27 21:00:03下载
    积分:1
  • Bigint
    利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
    2007-10-18 21:34:06下载
    积分:1
  • Kruskal
    采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
    2011-05-17 10:22:56下载
    积分:1
  • Polynomial
    Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)
    2013-12-11 11:05:18下载
    积分:1
  • yuyundonghui
    参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目,项目编号分别为 和 。由于各项目参加人数差别较大,有些项目取前五名,得分顺序为7,5,3,2,1;还有些项目只取前三名,得分顺序为5,3,2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单,内容包括各校所取得的每项成绩的项目号、名次(成绩)、姓名和得分;产生团体总分报表,内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据:对于 , , ,编号为奇数的项目取前五名,编号为偶数的项目取前三名,设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)
    2009-04-07 22:40:37下载
    积分:1
  • 00
    说明:  还是通讯录系统 增删改查 课程设计 本科学校要求的数据结构课程设计(Or address book CRUD the data structures required by the curriculum design undergraduate schools curriculum design)
    2012-06-17 21:36:24下载
    积分:1
  • BinaryTree
    数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
    2010-06-26 10:51:43下载
    积分:1
  • bTree
    这是一个二叉树的工程文件,包括了工程文件里的所有文件。以及二叉树的构建,traverse,搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )
    2011-05-20 08:12:04下载
    积分:1
  • linked
    关于二叉树的一些相关代码,运用链表的形式,求二叉树的高度,结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)
    2013-02-03 11:10:07下载
    积分:1
  • 696518资源总数
  • 106010会员总数
  • 4今日下载