Fire-Workflow-Engine-All-In-One-20090208 包含全部文檔,中文注釋
標(biāo)簽: Fire-Workflow-Engine-All-In-One 20090208 文檔
上傳時(shí)間: 2014-01-22
上傳用戶(hù):杜瑩12345
About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl
標(biāo)簽: C. hamsterdb structure database
上傳時(shí)間: 2013-12-11
上傳用戶(hù):LouieWu
Distributed Median,Alice has an array A, and Bob has an array B. All elements in A and B are distinct. Alice and Bob are interested in finding the median element of their combined arrays.
標(biāo)簽: array B. Distributed has
上傳時(shí)間: 2013-12-25
上傳用戶(hù):洛木卓
游戲開(kāi)發(fā)大全-game.programming.all.in.one
標(biāo)簽: programming game all one
上傳時(shí)間: 2013-06-30
上傳用戶(hù):eeworm
厚達(dá)1000頁(yè)的游戲編程書(shū)籍Game Programming All in One Bruno Miguel Teixeira de Sousa
標(biāo)簽: Programming Teixeira Miguel Bruno
上傳時(shí)間: 2014-01-01
上傳用戶(hù):15071087253
all in one 嵌入式系統(tǒng)平臺(tái)白皮書(shū)
標(biāo)簽: all one in 嵌入式系統(tǒng)
上傳時(shí)間: 2015-08-15
上傳用戶(hù):569342831
Floyd-Warshall算法描述 1)適用范圍: a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權(quán)可正可負(fù) 2)算法描述: a)初始化:dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結(jié)束:dis即為所有點(diǎn)對(duì)的最短路徑矩陣 3)算法小結(jié):此算法簡(jiǎn)單有效,由于三重循環(huán)結(jié)構(gòu)緊湊,對(duì)于稠密圖,效率要高于執(zhí)行|V|次Dijkstra算法。時(shí)間復(fù)雜度O(n^3)。 考慮下列變形:如(I,j)∈E則dis[I,j]初始為1,else初始為0,這樣的Floyd算法最后的最短路徑矩陣即成為一個(gè)判斷I,j是否有通路的矩陣。更簡(jiǎn)單的,我們可以把dis設(shè)成boolean類(lèi)型,則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來(lái)代替算法描述中的藍(lán)色部分,可以更直觀地得到I,j的連通情況。
標(biāo)簽: Floyd-Warshall Shortest Pairs Paths
上傳時(shí)間: 2013-12-01
上傳用戶(hù):dyctj
微軟Office.Project.2007傻瓜系列教材].Microsoft.Office.Project.2007.All.in.One.Desk.Reference.For.Dummies
標(biāo)簽: Project Office 2007 Microsoft
上傳時(shí)間: 2016-04-03
上傳用戶(hù):mhp0114
Games programming all in one code chapter 15
標(biāo)簽: programming chapter Games code
上傳時(shí)間: 2013-12-15
上傳用戶(hù):水中浮云
Games programming all in one code chapter 17
標(biāo)簽: programming chapter Games code
上傳時(shí)間: 2013-12-25
上傳用戶(hù):leixinzhuo
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1