動(dòng)態(tài)規(guī)劃算法：Max-Min Tree Paritioning
標(biāo)簽： Paritioning Max-Min Tree 動(dòng)態(tài)規(guī)劃
上傳時(shí)間： 2013-12-30
上傳用戶：z1191176801
javascript tree樹型控件。代碼很少.提供示例
標(biāo)簽： javascript tree 樹 控件
上傳時(shí)間： 2017-01-25
上傳用戶：frank1234
很好用得tree。也很簡(jiǎn)單。里面只有3個(gè)文件。
標(biāo)簽： tree
上傳時(shí)間： 2017-01-30
上傳用戶：13188549192
use eclipse+js platform impement tree menu
標(biāo)簽： impement platform eclipse menu
上傳時(shí)間： 2017-02-05
上傳用戶：15736969615
b+tree 的插入和查詢操作，代碼比較簡(jiǎn)練，效率高。缺少刪除操作。
上傳時(shí)間： 2013-12-19
上傳用戶：lijinchuan
A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as far to the left as possible. The data associated with all descendants of a node are smaller than the datum associated with this node.
標(biāo)簽： tree conditions completely satisfying
上傳時(shí)間： 2014-01-01
上傳用戶：gundan
This the beta version of the Christmas tree rendering whitepaper. A final version will be released in a later SDK with additional information and diagrams. Please visit the NVIDIA developer web page for updates:
標(biāo)簽： version whitepaper Christmas the
上傳時(shí)間： 2014-01-03
上傳用戶：waitingfy
這個(gè)是我調(diào)通的在2410下運(yùn)行文件系統(tǒng)的程序. 用2410驅(qū)動(dòng)sd卡來實(shí)現(xiàn)fat文件系統(tǒng). 歡迎大家來測(cè)試. 用法很簡(jiǎn)單, 如下 FILE *fp // 文件指針 unsigned char temp[24]="3.wav" // 文件明需要放在數(shù)組里 while(!initialize_media()) // 初始化sd卡 { Uart_Printf("sd initializing....\n") } Uart_Printf("sd ready\n") fp=fopen(temp, READ) // 打開文件就可以用了， 函數(shù)和標(biāo)準(zhǔn)c中的一樣,所以不能加載stdio.h if(!fp) { Uart_Printf("open file wrong\n") while(1) } Uart_Printf("open file successed\n")
標(biāo)簽： 2410 FILE fat 文件系統(tǒng)
上傳時(shí)間： 2013-12-30
上傳用戶：xlcky
my AVL tree implementation. Have tested it for 8! deletions sequences with 8! insertion sequences. Fast for order statistics.
標(biāo)簽： sequences implementation deletions insertion
上傳時(shí)間： 2017-03-02
上傳用戶：lixinxiang
spoj CCOST . Usage of a 2 dimensional fenwick tree.Querying (log(n)^2) a 2 dimensional matrix for sub sum and updating a cell in O(logn)
標(biāo)簽： dimensional Querying fenwick matrix
上傳時(shí)間： 2017-03-02
上傳用戶：chfanjiang
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
