數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì) 管道鋪設(shè)施工的最佳方案選擇 N(N>10)個(gè)居民區(qū)之間需鋪設(shè)煤氣管道。假設(shè)任意兩個(gè)居民區(qū)之間都可鋪設(shè),但代價(jià)不同。事先將任意居民區(qū)之間鋪設(shè)管道的代價(jià)存入文件。設(shè)計(jì)一個(gè)最佳方案,使得這N個(gè)居民區(qū)間鋪設(shè)管道的代價(jià)最小,希望能以圖形形式在屏幕上輸出結(jié)果。
標(biāo)簽: gt 10 數(shù)據(jù)結(jié)構(gòu) 方案
上傳時(shí)間: 2014-10-10
上傳用戶(hù):思琦琦
PMP 讀書(shū)心得 該作者以170分通過(guò)考試
上傳時(shí)間: 2014-01-05
上傳用戶(hù):zhuimenghuadie
O Reilly系列書(shū)籍之Java網(wǎng)絡(luò)編程(第二版),英文原版書(shū)籍,內(nèi)容講的比較全面。
標(biāo)簽: Reilly Java 書(shū)籍 網(wǎng)絡(luò)編程
上傳時(shí)間: 2014-01-17
上傳用戶(hù):gououo
1.功能 用全選主元高斯消去法計(jì)算矩陣A的秩(C語(yǔ)言) 2.函數(shù)參數(shù)說(shuō)明 double a[m][n] : 存放mxn階矩陣A的元素,返回時(shí)將被破壞 int m : 矩陣A的行數(shù) int n : 矩陣A的列數(shù) int rank() : 函數(shù)返回A的秩 3.文件說(shuō)明 rank.c為函數(shù)程序 rank0.c為主函數(shù)程序
上傳時(shí)間: 2015-09-03
上傳用戶(hù):xuan‘nian
1.功能 用全選主元高斯消去法計(jì)算n階方陣A所對(duì)應(yīng)的行列式的值(C語(yǔ)言) 2.參數(shù)說(shuō)明 double a[n][n] : 存方陣A的元素,返回時(shí)被破壞 int n : 方陣A的階數(shù) double sdet() : 函數(shù)返回行列式的值 3.文件說(shuō)明 sdet.c為函數(shù)程序 sdet0.c為主函數(shù)程序
標(biāo)簽: double 高斯 計(jì)算 C語(yǔ)言
上傳時(shí)間: 2014-01-14
上傳用戶(hù):rocwangdp
1.功能 利用廣義逆求解無(wú)約束條件下的優(yōu)化問(wèn)題(C語(yǔ)言) 2.參數(shù)說(shuō)明 int m : 非線性方程組中方程個(gè)數(shù) int n : 非線性方程組中未知數(shù)個(gè)數(shù) double eps1 : 控制最小二乘解的精度要求 double eps2 : 用于奇異值分解中的控制精度要求 double x[n] : 存放非線性方程組解的初始近似值X(0),要求各分量不全為0 int ka : Ka=max{m,n}+1 void (*f)() : 指向計(jì)算非線性方程組中各方程左端函數(shù)值的函數(shù)名(用戶(hù)自編) void (*s)() : 指向計(jì)算雅可比矩陣的函數(shù)名 int ngin() : 函數(shù)返回一個(gè)標(biāo)志值 3.文件說(shuō)明 ngin.c函數(shù)文件 ngin0.c主函數(shù)文件
上傳時(shí)間: 2013-12-23
上傳用戶(hù):大三三
1.功能 用高斯方法計(jì)算n重積分(C語(yǔ)言) 2.參數(shù)說(shuō)明 int n : 積分重?cái)?shù) int js[n] : js[k]表示第k層積分區(qū)間所劃分的子區(qū)間 void (*ss)() : 指向計(jì)算各層積分上、下限的函數(shù)名(用戶(hù)自編) double (*f)() : 指向計(jì)算被積函數(shù)值的函數(shù)名(用戶(hù)自編) double gaus() : 函數(shù)返回積分值 3.文件說(shuō)明 gaus.c為函數(shù)程序 gaus0.c為主函數(shù)程序
上傳時(shí)間: 2014-01-05
上傳用戶(hù):731140412
解國(guó)際象棋的N皇后問(wèn)題的C++源代碼,可用于大學(xué)計(jì)算機(jī)技術(shù)課程《算法分析》上機(jī)聯(lián)系
上傳時(shí)間: 2014-01-01
上傳用戶(hù):yyyyyyyyyy
support vector classification machine % soft margin % uses "kernel.m" % % xtrain: (Ltrain,N) with Ltrain: number of points N: dimension % ytrain: (Ltrain,1) containing class labels (-1 or +1) % xrun: (Lrun,N) with Lrun: number of points N: dimension % atrain: alpha coefficients (from svcm_train on xtrain and ytrain) % btrain: offest coefficient (from svcm_train on xtrain and ytrain) % % ypred: predicted y (Lrun,1) containing class labels (-1 or +1) % margin: (signed) separation from the separating hyperplane (Lrun,1
標(biāo)簽: classification support machine Ltrain
上傳時(shí)間: 2015-09-04
上傳用戶(hù):問(wèn)題問(wèn)題
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
上傳用戶(hù):lhc9102
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1