Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
功能說(shuō)明： 次組件提供的功能有二： 1、解析出數(shù)學(xué)表達(dá)式中的參數(shù) 2、計(jì)算數(shù)學(xué)表達(dá)式 此組件不但可以解析和計(jì)算數(shù)學(xué)表達(dá)式，還提供了一系列的數(shù)學(xué)基本函數(shù)，可應(yīng)用于表達(dá)式中一塊處理。提供的數(shù)學(xué)基本函數(shù)有：將值舍入到最接近的整數(shù) rount(x)、向下取整函數(shù) int(x)、向上取整 ceiling(x)、求兩個(gè)數(shù)中最大數(shù)的函數(shù) max(a,b)、求兩個(gè)數(shù)中最小數(shù)的函數(shù) min(a,b)、冪函數(shù) pow(x,n)、求平方根的函數(shù) sqrt(x)。 下載地址：http://www.qiusuo365.com/qiusuo365/viewthread.php?tid=2422&extra=page％3D1
標(biāo)簽： 表達(dá)式 計(jì)算 參數(shù)
上傳時(shí)間： 2014-01-18
上傳用戶：李夢(mèng)晗
C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random rand) , genRandomBits(int bits, Random rand) , isProbablePrime(int confidence) , isProbablePrime() , Jacobi(BigInteger a, BigInteger b) , LucasSequence(BigInteger P, BigInteger Q, BigInteger k, BigInteger n) ,max(BigInteger bi) , min(BigInteger bi) , modInverse(BigInteger modulus) , RabinMillerTest(int confidence) ,
標(biāo)簽： BigInteger class BIgInteger program
上傳時(shí)間： 2013-12-23
上傳用戶：ynzfm
采用 DVB反向鏈路（DVB-RCS）標(biāo)準(zhǔn)中的雙二元Turbo碼matlab仿真程序和仿真結(jié)果。支持1/2和1/3碼率。支持MAP，LOG-MAP解碼算法。
標(biāo)簽： DVB-RCS matlab Turbo DVB
上傳時(shí)間： 2015-11-19
上傳用戶：xhz1993
基于DSP平臺(tái)實(shí)現(xiàn)turbo碼Max_Log_MAP算法，基于標(biāo)準(zhǔn)C 語(yǔ)言研究 了Turbo 碼Max - Log - MAP 譯碼算法的軟件編程與實(shí)現(xiàn),為了提高程序的運(yùn)行效率,結(jié)合TMS320C6000 系列DSP 芯片 的結(jié)構(gòu)與特點(diǎn)采用循環(huán)展開、數(shù)據(jù)的存取優(yōu)化設(shè)計(jì)、算法改進(jìn)等措施進(jìn)行了代碼優(yōu)化,給出了測(cè)試結(jié)果，非常值得一看
標(biāo)簽： Max_Log_MAP turbo DSP 算法
上傳時(shí)間： 2014-01-11
上傳用戶：
％radon transform clear all ％ N=800 n=1:N fs=200 t=n/fs x1=exp(j*2*pi*(5*t+0.5*5*t.^2)) x2=exp(j*2*pi*(5*t+0.5*15*t.^2)) x=x1+x2 ％N=length(x) ％ ambifunb(x ) ％*****************************************RAT naf=ambifunb(x) htl(abs(naf)) ％ [wh,rho,theta]=htl(abs(naf)) colormap([0,0,0]) ％ xlabel( 極半徑 ) ％ ylabel( 角度 ) ％**************************************％找出峰值點(diǎn)的坐標(biāo),計(jì)算初始頻率和調(diào)頻斜率(正確) ％找出峰值點(diǎn)的坐標(biāo) b=max(max(wh)) [u,a]=find(wh>=0.8*b)
標(biāo)簽： transform radon clear fs
上傳時(shí)間： 2014-10-27
上傳用戶：Yukiseop
The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra- group similarity while minimizing the inter-group similarity． The first and foremost question needed to be considered in clustering W b sessions is how to measure the similarity between Web sessions．However．there are many shortcomings in traditiona1 measurements．This paper introduces a new method for measuring similarities between Web pages that takes into account not only the URL but also the viewing time of the visited web page．Yhen we give a new method to measure the similarity of Web sessions using sequence alignment and the similarity of W eb page access in detail Experiments have proved that our method is valid and e幣cient．
標(biāo)簽： sessions clustering similarity Web
上傳時(shí)間： 2014-01-11
上傳用戶：songrui
一個(gè)小的telnet程序與大家共享，/* 本程序支持如一些參數(shù)： * --host IP地址 或者 -H IP地址 * --port 端口 或者 -P 端口 * --back 監(jiān)聽數(shù)量 或者 -B 監(jiān)聽數(shù)量 * --dir 服務(wù)默認(rèn)目錄 或者 -D 服務(wù)默認(rèn)目錄 * --log 日志存放路徑 或者 -L 日志存放路徑 * --daemon 使程序進(jìn)入后臺(tái)運(yùn)行模式 */
上傳時(shí)間： 2016-11-20
上傳用戶：515414293
這個(gè)連接池是直接從JIVE中取出來(lái)的，進(jìn)行了一下修改，使得連接參數(shù)直接在程序中設(shè)定而不是從屬性文件中讀取。 [b]用法：[/b] 先設(shè)定自己的連接參數(shù)，在DbConnectionDefaultPool.java文件的loadProperties方法中。注意你也需要設(shè)定連接池的log文件的存放位置。
上傳時(shí)間： 2016-11-21
上傳用戶：TF2015
Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. Consider a1a2…am and b1b2…bn. Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
標(biāo)簽： the subsequence determine Instead
上傳時(shí)間： 2013-12-17
上傳用戶：evil
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
