搜索资源列表
最短路径在铁路上实现的
- 是一种数据结构的编程代码，程序实现一种算法，在铁路系统上在两点间得到最短路径-is a data structure of the programming code, procedures to achieve an algorithm, the railway system in the period between 2:00 Shortest Path
一维四点偏心格式vb源程序
- 一个用VB编写的一维四点格式算法的源程序，很好用-one prepared by the VB one-dimensional 4:00 algorithm source format, with a good
最短路径c++语言
- 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c + + to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
CInterpolate
- 插值类 CInterpolate 一元全区间不等距插值 一元全区间等距插值 一元三点不等距插值 连分式不等距插值 埃尔米特不等距插值 光滑不等距插值 二元全区间插值-interpolation category CInterpolate one yuan is not equidistant between the region interpolation one yuan region equidistant between 3:00 interpolation one yuan is
求一个Dijkstra优化算法
- 求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance be
pointtopointDijkstraAlgrithms
- 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the sh
Strassen_8
- Strassn关于两个矩阵相乘的算法，同过分治原理把两个n*n的矩阵阶各分解成四个n/2*n/2阶的矩阵，当分解出来的矩阵阶数等于2时，求借各个小矩阵，若阶数大与2，就递归的调用前面方法，直到分解成2*2的子矩阵为止。-Strassn on two matrix multiplication, the algorithm, with the governing principle over two n * n matrix of the band decomposed into 4 n / 2
host2
- 马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。-horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.
Floyd-A
- Floyd最短路径算法的VC7.0试验成功！可以计算2点间的最短路径。-Floyd shortest path algorithm VC7.0 success of the test! 2:00 calculating the shortest path.
xinli
- 某心理咨询公司有三个顾员，其编号为1~3，他们上班时间为每天的8~17点，请打出某天他们接待咨询的时间。-a psychological consulting company three LAB, the No. 1 ~ 3, They go to work every day for the 8 ~ 17:00, making Somewhere they receive counseling time.
shortestpathbetweenpoints
- 假设有一间房子,在房子丽的任意两点之间铺设电线,要求线要和墙面平行,求最短距离.用了贪婪算法.-assuming a room in the house arbitrary Korea between 2:00 cables require line parallel to the wall and, for the shortest distance. with a greedy algorithm.
MinPath
- 数据结构应用，用以寻找2点之间的最短路径，有效节省时间。以上程序只是一个雏形-application data structures, 2:00 to find the shortest path between effectively save time. Above procedure is just a prototype
fractions_compositor
- 写一个程序，列出在0和1之间的所有分母不大于N的最简分数，下面是N＝5时的情况： 0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1/1 总共有11个分数! 还需要进行排序。-write a procedure set out in the 0 and 1 denominator between all the N is not greater than the most simple level, Below is N = 5:00 of : 0 /
soj1169Networking
- /* Name: soj 1169: Networking From: Computer Science Department of Sichuan University Author: LoyaltyJi Date: 03-05-06 00:35 Descr iption: 求最小生成树经典题! */-/ * Name : soj 1169 : Networking From : Computer Science Department of Sichuan
windows
- 滑动窗口模拟 // 对滑动窗口中每一个2字节串排序 // 排序是为了进行快速术语匹配 // 排序的方法是用一个64k大小的指针数组 // 数组下标依次对应每一个2字节串：(00 00) (00 01) ... (01 00) (01 01) ... // 每一个指针指向一个链表，链表中的节点为该2字节串的每一个出现位置
SVM
- 这里实现了四种SVM工具箱的分类与回归算法 1、工具箱：LS_SVMlab Classification_LS_SVMlab.m - 多类分类 Regression_LS_SVMlab.m - 函数拟合 2、工具箱：OSU_SVM3.00 Classification_OSU_SVM.m - 多类分类 3、工具箱：stprtool\\svm Classification_stprtool.m - 多类分类 4、工具箱：SVM_SteveG
simpleloop
- 数据结构里的判断两点之间是否有简单路径和判断是否有简单回路，用vc6.0编写-data structures between 2:00 judgment whether a simple path and determine whether there is any simple circuit, prepared with vc6.0
critical_path
- 实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径-achieve a critical path algorithm. Given some point and fixed-point to the right path of duty between 2:00 seek the shortest path
8Q
- 8皇后问题的解算程序,DOS 系统下运行，使用MS C6.00 编译，演示一种搜索算法-example for 8-QUEEN
00
- 这是王晓东老师编著的算法设计与分析第三版的课件-It is edited by Wang Xiaodong teachers algorithm design and analysis of the third edition of the courseware