登录
首页 » Visual C++ » CEIA

CEIA

于 2011-10-25 发布 文件大小:3KB
0 242
下载积分: 1 下载次数: 2

代码说明:

  POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

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

发表评论

0 个回复

  • Strassen-code
    思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)
    2014-11-28 14:33:16下载
    积分: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
  • 12
    说明:  哈希表,用c++语言编写,可操作运行,结果正确(Hash table, using c++ language, operational run, the results are correct)
    2011-05-06 14:42:14下载
    积分:1
  • Cpp1
    校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
    2012-06-20 21:57:32下载
    积分:1
  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • tu
    说明:  、实验目的 1 熟练掌握各种内排序方法,深刻理解排序算法及其执行过程; 2 学会分析各种内排序算法的性能; 3 了解各种排序方法的优缺点,对于实际问题能够选择一种较好的排序方案; 4 熟练掌握图的存储结构; 5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。 6 了解图的最小生成树算法。 (Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)
    2009-12-30 21:15:29下载
    积分:1
  • Is_BST
    This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
    2012-02-02 05:45:59下载
    积分:1
  • ACRush_2_1
    这是acm高手楼天城的比赛代码,很有用哦,对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)
    2011-06-16 21:00:05下载
    积分:1
  • shellpaixu
    希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
    2013-07-18 15:11:39下载
    积分:1
  • 在COM中使用组_code
    COM中使用SAFEARRAY数组例程,代码中给了两种数组的用法,一种是字符串数组,另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)
    2005-07-12 17:00:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载