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.
標簽： 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
標簽： distinct elements fenwick number
上傳時間： 2014-01-20
上傳用戶：lhw888
1.1 異常分類 基于Dr. GUI 的建議，我把我的第一個專欄投入到“程序異常”的系列上。我認識到， “exception”這個術語有些不明確并和上下文相關，尤其是C++標準異常（C++ standard exceptions）和Microsoft 的結構化異常（structured exception handling）
上傳時間： 2013-12-23
上傳用戶：yepeng139
自己編的，在VB中實現普里姆最小生成樹算法的代碼，有圖的，邊的權值是隨機生成的，5個節點，點“generate tree”，就會顯示出最小樹。
標簽：
上傳時間： 2017-04-09
上傳用戶：Andy123456
一個簡單的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后臺的交互
標簽： Ext
上傳時間： 2013-12-23
上傳用戶：qweqweqwe
The purpose of the design pattern dictionary is to serve as reference point for commonly accepted software design patterns and idioms. It contains structured summaries of some 30 design patterns and idioms, commonly used in object oriented programming
標簽： dictionary reference accepted commonly
上傳時間： 2013-12-21
上傳用戶：leixinzhuo
伸展樹，基本數據結構，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.
標簽： 樹
上傳時間： 2017-05-07
上傳用戶：JIUSHICHEN
The 2D CFD Program NaSt2D The program is a 2D solver for the incompressible, transient Navier-Stokes equations including the temperature equation and free boundary problems. It uses finite differences for discretization on a structured equidistant staggered grid, central and upwind (donor-cell) discretization of the convective parts and an explicit time stepping scheme. The free boundary value problems are treated with the MAC technique.
標簽： incompressible Navier-Sto The transient
上傳時間： 2013-11-30
上傳用戶：xfbs821
ZigBee路由協議指的是ZigBee規范中規定的與路由相關的功能和算法部分，主要包括不同網絡拓撲結構下ZigBee協議數據單元的路由方式、路由發現和路由維護等內容。為了達到低成本、低功耗、可靠性高等設計目標，ZigBee網絡采用了Cluster-Tree與AODV路由相結合的路由算法。該包實現了ZIGBEE路由算法在NS2下的模擬
上傳時間： 2017-05-14
上傳用戶：WMC_geophy
一個實現struts+spring+hebernate的例子，外加一個JavaScript實現的tree的都OK了。
上傳時間： 2013-11-25
上傳用戶：skhlm
