自己做的數(shù)據(jù)結(jié)構(gòu)實驗題（合并鏈表，huffman tree,表達式求值）
標(biāo)簽： 數(shù)據(jù)結(jié)構(gòu) 實驗 合并
上傳時間： 2016-12-31
上傳用戶：redmoons
專家點評: Y P7 `. @ {$ r％ pa.功能很強大，可以看出花了很多心血在算法上，非常好。算法上還有一點瑕疵，例如在刪除一個員工的同時沒有辦法自動建立其他員工的上下級關(guān)系，必須刪除全部下級員工，不是非常合理。此外，界面設(shè)計過于簡單，應(yīng)該加強. " W" R+ b* g$ a$ Sb.程序運用了自己的算法來提高Tree控件顯示的速度和資源分配，這個非常值得肯定和鼓勵。* C. c4 D0 e9 ` J$ w# U c.基本實現(xiàn)所有規(guī)定的功能，在所有參賽者中唯一熟 : O) l- F6 F9 f) S7 Q. l練使用面向?qū)ο笤O(shè)計方式開發(fā)程序的工程師，很不錯！程序體現(xiàn)了作者非常扎實的數(shù)據(jù)結(jié)構(gòu)功底，值得大家學(xué)習(xí)。工程管理也做得非常好，體現(xiàn)了作者在軟件工程方面也有很深入的研究，該代碼是很好的學(xué)習(xí)范例。 ％ G* H$ ~3 W1 ]. e! id.算法的創(chuàng)新是獨特之處(hashtable算法建立),可見作者在數(shù)據(jù)結(jié)構(gòu)方面的熟練掌握.此程序是很多專家會員學(xué)習(xí)典范.
上傳時間： 2017-01-19
上傳用戶：奇奇奔奔
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
Huffman codes In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. This problem can by solved by using an extended binary tree which is used in the 2- way merging problem.
標(biāo)簽： telecommunication represent messages Huffman
上傳時間： 2014-01-04
上傳用戶：x4587
讀取XML信息，顯示在tree上。并且提供各種控制功能
上傳時間： 2013-12-19
上傳用戶：gououo
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
標(biāo)簽： implementation double-array representing structure
上傳時間： 2013-12-10
上傳用戶：shinesyh
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries
標(biāo)簽： distinct elements fenwick number
上傳時間： 2014-01-20
上傳用戶：lhw888
自己編的，在VB中實現(xiàn)普里姆最小生成樹算法的代碼，有圖的，邊的權(quán)值是隨機生成的，5個節(jié)點，點“generate tree”，就會顯示出最小樹。
標(biāo)簽：
上傳時間： 2017-04-09
上傳用戶：Andy123456
一個簡單的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后臺的交互
標(biāo)簽： Ext
上傳時間： 2013-12-23
上傳用戶：qweqweqwe
伸展樹，基本數(shù)據(jù)結(jié)構(gòu)，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
標(biāo)簽： 樹
上傳時間： 2017-05-07
上傳用戶：JIUSHICHEN
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
