资源列表
用lingo求解最短路的范例
- 用lingo求解最短路的范例,可在lingo9上运行,Lingo with an example of solving the shortest path can be run in lingo9
apFFT_Test 和大家分享一个全相位FFT
- 和大家分享一个全相位FFT,matlab程序,程序中全相位fft实现方法有两种,注释掉的根据原理推到得来,自己看吧。-And share a full-phase FFT, matlab program, the program fft implementation in all phase two, comment out the basis of the principle pushed to come, see for yourself.
fft
- fft程序,高质量,效率高,大把方法飞机及附件啊 -fft
fan
- 问题描述: 球赛门票的售票处规定每位购票者限购一张门票,且每张门票售价50元。购票者中有 m位手持50元钱币,另有n人手持100元。假设售票处开始售票时无零钱。问这m+n人有 几种排队方式可使售票处不致出现找不出钱的局面。 编程任务: 对给定的m,n(0<=m,n<=11),输出各种排队方式(从小到大),计算出排队方式总数。 -Problem Descr iption: The box office ticket sales are limited to th
suanfa
- 用贪心算法解决单源点最短路径问题并打印出任意两点的具体路径(C语言实现)-With a greedy algorithm to solve single-source shortest path problem and print out the specific path between any two points (C language)
Dijkstra
- C++实现求单源最短路径,可以由用户自己构造有向无环图-C++, find single-source shortest path can be constructed by the users themselves have directed acyclic graph
bubble-sort
- 基于for循环的冒泡排序法,第一次上传还要这么麻烦,到二十个字了没-For loop based on bubble sort method, first upload should be so troublesome to twenty words yet
tree
- 构建树状数组,根据两点之间的路劲长度是否等于其编号差(mod n)来判断两点是否相通。-Construction of the tree array, according to the length between two points of the Road King is equal to its number difference (mod n) to determine whether two interlinked.
insertsort
- 插入排序算法1.for 循环找出一个待比较的值,然后进入while循环中,与数组中下标比它小的数据进行比较, * 因为下标比它小的数据都是排好序的,当a[i]大于这个数时,将a[i]往后移一下,就是这个数 * 的下标加1,依次循环,将比这个数的的数都移动到此数的后面,假如:当执行i--后,while条件 * 不成立,从而退出了while循环,此时,下标为i的数组值小于这个标准数,所以将这个标准数放到 * 下标为i+1的数组中。当for循环结束时,此数组中的所有元素都是有序的-In
maze
- 简单迷宫的搜索问题,其中#为路,*为墙,0为入口,1为出口,输入地图为矩阵-Simple maze search problem, where# is the way* for the wall, 0 is the entrance, one for export, enter the matrix map
MaxAndMin
- 递归分治思想实现S串中同时求出最大元和最小元。-with divid and conquer, to find out the max and min number in the string S.
poj1947Rebuilding-Roads
- poj1947Rebuilding Roads的AC代码,解法是树形DP-poj1947Rebuilding Roads AC code, the solution tree DP