depth-first造句
例句與造句
- Therefore , we can implement the depth - first traversal in the
因此，我們可以在抽象 - Depth - first visitors and broken dispatches
深度優(yōu)先訪問(wèn)器和中斷的分派 - With depth - first visitors , this is especially easy to do
通過(guò)深度優(yōu)先訪問(wèn)器，特別容易發(fā)生這種情況。 - Diagnosing java code : depth - first visitors and broken dispatches
診斷java代碼:深度優(yōu)先訪問(wèn)器和中斷的分派 - The search is depth - first
該搜索為深度優(yōu)先。 - It's difficult to find depth-first in a sentence. 用depth-first造句挺難的
- Depth - first visitors ,
深度優(yōu)先訪問(wèn)器 - Note that it is possible to select other algorithms besides a depth - first walk
注意，也可以選擇深度優(yōu)先遍歷之外的其他算法。 - Depth - first search
深度優(yōu)先搜索 - Also , the implementor of a depth - first visitor would have handy in the signatures of the
另外，對(duì)于每種類型，深度優(yōu)先訪問(wèn)器的實(shí)現(xiàn)將有一個(gè)容易獲得（在 - So there you have it : depth - first visitors , why they re cool , and how they can bite you
因此，您就知道了為什么深度優(yōu)先訪問(wèn)器很酷以及它們會(huì)怎樣刺痛您。 - For visitors that descend depth - first in all but a few cases , we can still use a depth - first visitor
對(duì)于大多數(shù)向下深度優(yōu)先的訪問(wèn)器，我們?nèi)钥梢允褂蒙疃葍?yōu)先訪問(wèn)器。 - Depth - first visitors are constructed by the " java tree builder , " a free tool available in
深度優(yōu)先訪問(wèn)器是通過(guò)“ java樹構(gòu)建器（ java tree builder ） ”構(gòu)造的，它是一種可以從 - The first one is a typical xslt stylesheet ; the second is a rewriting that exposes the depth - first walk
第一個(gè)是典型的xslt樣式表，第二個(gè)對(duì)第一個(gè)進(jìn)行了改寫，以便公開所采用的深度優(yōu)先遍歷算法。 - Performs a depth - first walk of the input tree , this is the same depth - first algorithm you learned in programming 101
對(duì)輸入樹進(jìn)行深度優(yōu)先的遍歷，這和您在編程101中所學(xué)的深度優(yōu)先算法沒(méi)有什么不同。 - The processor takes care of much of the basic coding such as looping and passing parameters to implement a depth - first search
，可以看出處理程序處理了很多基本代碼（比如循環(huán)和傳遞參數(shù)） ，以便實(shí)現(xiàn)深度優(yōu)先的搜索。
更多例句： 下一頁(yè)