tree node 中文意思是什麼
tree node
解釋
樹節點-
In prop2xml, the initial dom tree is constructed from a predefined xml skeleton, instead of constructing the initial tree node - by - node from scratch
在prop2xml中。初始dom樹從預先定義的xml框架構造開始逐個節點地構造初始樹,而不是從頭開始。 -
Gets the tree node containing the text to edit
獲取包含待編輯文本的樹節點。 -
Gets or sets the image list index value of the image that is displayed when a tree node is selected
獲取或設置當樹節點選定時所顯示的圖像的圖像列表索引值。從 -
Gets or sets the image list index value of the image displayed when the tree node is in the unselected state
獲取或設置當樹節點處于未選定狀態時所顯示圖像的圖像列表索引值。 -
Gets or sets the image list index value of the image that is displayed when the tree node is in the selected state
獲取或設置當樹節點處于選定狀態時所顯示的圖像的圖像列表索引值。從 -
Retrieves the tree node that is at the specified point
檢索位於指定點的樹節點。 -
Gets a value indicating whether the tree node is in the selected state
獲取一個值,用以指示樹節點是否處于選定狀態。 -
Gets a value indicating whether the tree node is in an editable state
獲取一個值,用以指示樹節點是否處于可編輯狀態。 -
Gets a value indicating whether the tree node is in the expanded state
獲取一個值,用以指示樹節點是否處于可展開狀態。 -
Gets a value indicating whether the tree node collection has a fixed size
獲取一個值,該值指示樹節點集合是否具有固定大小。 -
Gets or sets a value indicating whether the tree node is in a checked state
獲取或設置一個值,用以指示樹節點是否處于選中狀態。 -
Gets a value indicating whether the tree node is visible or partially visible
獲取一個值,用以指示樹節點是否是完全可見或部分可見。 -
Gets the new text to associate with the tree node
獲取與樹節點關聯的新文本。 -
Control automatically generates tree node bindings
控制項是否自動生成樹節點綁定。 -
Control automatically generate tree node bindings ; otherwise,
控制項自動生成樹節點綁定,則為 -
The zero - based depth of the tree node in the
控制項中的樹視圖的深度(從零開始) 。 -
Gets the path from the root tree node to the current tree node
設置從根樹節點到當前樹節點的路徑。從 -
The following code example brings the last child tree node of the last root tree node into view in the tree view when a button is clicked
下面的代碼示例演示如何在單擊按鈕時,在樹視圖中顯示最後一個根樹節點的最後一個子樹節點。 -
Removes the current tree node from the tree view control
從樹視圖控制項中移除當前樹節點。 -
The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds, and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex, and uses backtracking method to obtain optimum solution
該演算法用團的簡單啟發式演算法提供下界;用加權著色的啟發式演算法提供上界;在分支階段,每次只產生一個新的子問題,並利用著色信息來選擇分支頂點;最後利用回溯法來檢驗整體最優性。
分享友人