登录
首页 » Visual C++ » Anorldi

Anorldi

于 2011-10-22 发布 文件大小:1980KB
0 227
下载积分: 1 下载次数: 16

代码说明:

  关于Arnoldi算法的今年来的中文资料,希望能够给有兴趣编写这方面算法的人提供帮助(Arnoldi algorithm on the Chinese data this year, hoping to write this algorithm are interested in helping people)

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

发表评论

0 个回复

  • cycQueue
    单循环链表,用C++实现 提供入队,出队,判断空等方法(Single cycle linked list, with C++ into the team, the team judge waited in vain for methods)
    2012-10-08 20:02:15下载
    积分:1
  • c++
    一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
    2017-12-13 20:06:55下载
    积分:1
  • migong
    以一个m*n的长方阵表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)
    2013-06-14 10:24:48下载
    积分: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
  • 5-source--code-of-DS--PRO
    数据结构课上老师布置的5个小项目的源代码,分别是汽车过河,一元多项式,迷宫,日历,BFS_DFS(failed to translate)
    2011-05-18 17:01:17下载
    积分:1
  • 2.2
    已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)
    2015-04-11 23:11:41下载
    积分:1
  • Binary-tree-in-the-establishment
    二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)
    2013-03-30 14:39:13下载
    积分:1
  • JOSEPHUS
    一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)
    2011-08-13 10:09:20下载
    积分:1
  • BresenhamLine
    在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)
    2012-06-03 18:21:13下载
    积分:1
  • SeqQueue
    数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
    2013-06-15 16:27:32下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载