搜索资源列表
Strassen11
- 矩阵相乘的Strassen算法，其中 乘积矩阵C = H*H，H =（hij）n*n 1. hij = ， i，j=1，…8 2. i，j=1，…12 矩阵H =（hij）n*n自动生成，取小数点后面6位计算 -Strassen matrix multiplication, the algorithm, the product matrix C = H * H, H = (hij) n * n 1. hij =, i, j = 1, ... 2. i, j = 1, ...
ClassPoint_C++
- 这里提供一套C++的point定义类,里面有丰富的成员函数,全部通过验证。同时也望朋友们对其进行扩充和改进，我的联系地址为 yxding@gmail.com
Data-Structures-in-C
- Data Structures in C：Concept and Implementation. Data Structures in C Power Point
几何算法
- 一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged strai
Dijkstra
- 这个例程,会在多条相同最短路径中选出边数最少的路径.只是改变path域即可在遍历的时候访问到边数少的路径.核心的思想,就是建立一个数组,存放从出发点到当前顶点的最短路径边数.通过每次查看最短路径相同的情况, 即dv + cvw = dw.时,如果 Count[v] + 1 < Count[w]时,就执行 Count[w] = Count[v] + 1, 同时 w -> path = c.-This routine will be the same number of shortest
second
- 完成一个程序实现双向链表使之有如下功能 (如用C++实现，需要有默认的构造函数, 析构函数) C语言实现，初始化一个双向链表 添加一个元素到链表 删除链表中的一个元素 其他你认为必要的链表操作 总有两个指针,一个指向表中第一个元素另一个指向最后一个元素 -Completion of a program to achieve a two-way linked list so that the following functions (such as C++ Reali
WinNTL-5_3_1
- 密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary p
BuildAndOutputDiagramForC
- 用C语言实现数据结构中的图的建立和输出，可实现输出有向图和无向图，由用户自己选择建立有向图还是无向图的邻接矩阵。用户输入图的定点和边的信息，存储到相应的存储结构中去，而后输出图的邻接矩阵。-Data structure using C language implementation of the map creation and output, enabling the output have to map and undirected graph, chosen by the user to
dbPoint.c
- C语言实现，分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
Theshortestpathroutingalgorithms
- 最短路由算法用c++编写的程序能解决路由从一点到令一点的最短路径-Shortest routing algorithm using c++ programs written to solve the routing from point to point shortest path that
pairdistance
- 在C语言环境下，实现寻找空间中最近点对的有效算法。-In the C language environment, to achieve search space, the nearest point on the efficient algorithm.
pointcardmarketingsystem
- 一个完整的点卡销售系统，是基于c++用vs2005开发的，有源程序和文档设计报告，是我们软件工程的课程设计。-A full point card marketing system is based on using vs2005 c++ development, design reports with source code and documentation is our software engineering course design.
Djikstra
- 求定点到任一点最短路径的算法，运用c语言编译 dijkstra算法的源代码-Designated arrival point seeking the shortest path algorithm, dijkstra algorithm using c language compiler source code
C-language-a-few-small-programs
- C语言的几个小程序，四舍五入的方式精确到小数点后第四位，把一张一元钞票,换成一分、二分和五分硬币,每种至少11枚,问有多少种方案?-C language, a few small programs：Rounded to the nearest way to fourth place, to a one dollar bill, replaced by a point, two points and five coins, each at least 11, and asked how many
c
- c语言编写的 包含平均数 求和 排序 最值 鞍点-c language contains the value of the average sum of ordering the saddle point
cordic-c-vc-6.0
- cordic算法的c语言实现，输入x，y两点坐标，自动计算得出改点与平面坐标轴（x轴正向）夹角，适用于整个坐标平面。于环境vc 6.0下编译通过。-CORDIC algorithm realize the C language, input x, y coordinates of two points, are automatically calculated to change point and plane coordinate axis ( x axis positive ) angle,
cordic-fixed-point-c-vc6.0-
- cordic算法的c语定点数仿真，输入x，y两点坐标，自动计算得出改点与平面坐标轴（x轴正向）夹角（有一定误差），适用于整个坐标平面。于环境vc 6.0下编译通过。-CORDIC algorithm C language fixed point simulation, enter the X, y coordinates of two points, are automatically calculated to change point and plane coordinate axis (
c-program
- main函数中结构数组a中存储了5个职员的工资信息（这里称每个职员的工资信息为一条“记录”）。sift函数的形参cond接收筛选条件字符串，函数实现从s指向数组元素开始的n个元素中筛选出所有wage符合筛选条件的记录并将这些记录复制到res指向的结构数组。函数返回res数组中存储的记录数（筛选结果）。-The main function is stored in an array of structures a five staff wages (here referred to the inf
file
- 将图的数据写入文件并构造邻接矩阵，求出单源点到其他顶点的最短路径(The data of the graph is written into the file and the adjacency matrix is constructed, and the shortest path from the single source point to the other vertex is found)
Check bus routes
- 问题描述 当一个用户从甲地到乙地时，由于不同需求，就有不同的交通方式及不同的交通路线。有人希望以最快速度到达，有人希望以最短距离到达，有人希望用最少的费用等。交通方式有公交车和地铁。编写一北京公交线路查询系统，通过输入起始站、终点站，为用户提供三种或以上决策的交通咨询。(problem descr iption When a user goes from point a to point b, there are different modes of transportation and d