登录
首页 » Visual C++ » Anorldi

Anorldi

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

代码说明:

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

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

发表评论

0 个回复

  • 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
  • Josephus(data_struct)
    数据结构中基于约瑟夫环问题,用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
    2013-11-17 11:30: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
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • Test6
    最短路径算法。 用无向带全图的邻接矩阵存储图,确定从源点出发到其它各点的最短路径。 输入:图中包含的顶点数n 边数m, 各边权值,用邻接矩阵或者邻接表存储。 输出:源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
    2014-05-11 17:05:37下载
    积分:1
  • 0908030206xin
    一、 地理数据文件应用 对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。 要求: 1、在C++环境下,通过程序设计实现文本格式数据文件的操作; 2、在打开数据文件后,生成点、线、面三个链表,分别用于记录三种类型的数据。 3、数据文件结构说明 (Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)
    2012-09-14 20:33:26下载
    积分:1
  • xianduan
    输入俩条线段的首尾坐标,用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)
    2011-05-22 22:47:16下载
    积分:1
  • Expressions
    表达式cpp实现 数据结构实验源代码 实现前序、中序、后序表达式(Expression codes Formerorder expressions regular expression&Postorder expressions )
    2011-05-30 16:37:42下载
    积分:1
  • datastr
    VC++常用的数据结构类源码 这是我在VC++日常开发中收集的一些经常用到的类库,每一款都可以轻松重用,这些类库适用于vs2003及以上的开发环境,其中 Thread 和 Delegate 是从C#中得到的灵感,还有一些是在使用开源代码或其它语言时得到的启发和灵感。个人认为部分代码还算好用,所以拿来分享一下。部分类库附带有例子,欢迎参考。 (Commonly used data structures in VC++ class source This is the daily development of VC++ I collected some frequently used library, each designed to easily reuse these libraries apply to vs2003 and development environment, including Thread and Delegate inspiration from C#, there are some inspired use of open source code or other languages ​ ​ and inspiration. Personally think that part of the code is fairly easy to use, so used to share. Some class library included with examples for reference.)
    2012-08-14 14:00:37下载
    积分:1
  • MyGPS
    1>实现可以随意浏览任一景点的介绍。(功能一) 2>可以给出任意两个景点的最短距离及其路线。(功能二) 3>可以查看任一景点热度,并可以对对所有景点热度(访问次数)进行排序。(功能三) 4>每个景点相关内容从文件读取,实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)
    2015-11-12 22:16:01下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载