tree graph 中文意思是什麼
tree graph
解釋
樹圖-
A tree is a connected graph with no cycles.
一個樹是一個沒有圈的連通圖。 -
Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。 -
( 3 ) a category - based dynamic graph. ( cdg ) structure, which supports the novel tactic of relation - oriented collision detection, is presented to improve the efficiency of collision detection and realize the attached motion in vr scene. ( 4 ) a dynamic 8 - tree structure and a relative self - similar recursion algorithm are presented to model a dynamic workpiece object, which is machinable
（ 3 ）提出並實現了基於分類的動態圖結構（ cdg ） ，該結構支持面向關系的碰撞檢測，很好的解決了虛擬cnc銑床環境下碰撞檢測的唯一性和完全性問題，在很大程度上提高了碰撞檢測的實時性，並實現了虛擬環境下的關聯運動。 -
By analyzing the topology of an interconnected power system, chapter 3 of this thesis derives the spanning tree, and builds the corresponding minimal cut set. by combining the results from the graph theory with the reliability indices of the individual reparable components, the reliability indices at the load point can be obtained, and the reliability indices for the whole system are deduced
本文的第三章從單個可修復元件的可靠性指標出發，在分析電網路的拓撲結構的基礎上，利用一定的演算法求出其對應的生成樹，根據生成樹和最小割集之間的對應關系，得到整個電網路的最小割集。 -
Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach
保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。 -
Representation, classification and global reference name standard of the common security knowledge, are summarized. then a new model of system security trend analysis is presented, which combines vulnerability analysis ( using privilege graph analysis method ) and attack knowledge analysis ( using goal tree analysis method )
本論文首次從信息對抗的角度分析了公共知識獲取和安全趨勢分析的意義，系統總結了公共知識分類、標準與知識描述等方面問題，給出動態防禦系統中公共知識獲取的方法，提出了權限圖與攻擊樹相結合的目標系統安全趨勢分析方法。 -
Introduced in this paper is the forest graph of a connected graph which is a generalization of the tree graph
摘要本文中引進了連通圖的森林圖，它是樹圖的推廣。 -
Evidently, the graph must be connected in order to contain a spanning tree.
顯然一個圖必須是連通的才能包含一生成樹。 -
Based on the above works, the distance education resource warehouse is improved in this thesis by adding the storage and management of media material metadata and learning content hierarchy graph ; the learning model of distance education system is improved and introduced. the transformation algorithm between learning content hierarchy graph and and / or tree is given. finally, the researc
在以上理論研究成果的基礎上，對現有的遠程教育資源庫進行了改進，增加了媒體素材庫元數據和學習內容層次圖的存儲和管理；同時對遠程教育系統學習模型進行了改進，給出了改進后的遠程教育系統學習模型示意圖，並給出了學習內容層次圖和and / or樹之間的構造轉換的具體演算法。 -
Especially, the adjacent tree graph and line graph are both included as special cases of our generalization
特別，鄰接樹圖和線圖是我們推廣的特殊情況。 -
( 2 ) basic graph of quasi - fuzzy graph matriod : basic graph is extending tree graph, and it is an important tool by which matroid is studied
2 ）準模糊圖擬陣的基圖：基圖是樹圖概念的推廣，是研究擬陣的重要工具。 -
In the last chapter, we use the results of higher order edge connectivity to study the tree decomposition of transitive graphs, deriving a sufficient condition for a graph to have tree number equivalent to the arboricity
在最後一章中，我們使用高階邊連通度的結果研究對稱圖中樹分解的一個問題，給出了森林數等於樹數的一個充分條件。 -
The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent
本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中，增加了判斷簡單連接的條件，使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等，該演算法更加有效;在生成樹協議物理拓撲發現演算法中，正確使用stp 、 snmp和arp三種協議，物理拓撲發現非常準確;在vlan物理拓撲發現演算法中，正確運用了ieee802 . 1q協議，該演算法具有通用性。 -
Existent automatic grading model of programs can not deal with the programs with structural body. in this paper, we study the syntax and concept of structural body based on an existed model, and improve the original model in the following aspects : increasing the middle representation form of structural body in analysis of morphology and syntax and system dependence graph and abstract syntax tree, adding standardization rules, mainly including type definition, nesting structure, initialization, function invocation, renaming and sequence of program sentence, besides standardization rules of bit operation and program with enumeration, enhancing the function of inspecting syntax error and improving matching strategies
本文在原有的編程題自動評分模型的基礎上，對結構體的語法結構和實現原理進行研究，並在以下幾個方面完善原有模型:在詞法和語法分析、程序的系統依賴圖建立和抽象語法樹生成三個方面增加結構體類型的中間表示形式;擴充程序的標準化規則，主要包括類型定義標準化、結構體嵌套結構標準化、結構體初始化的標準化、結構體作為函數參數時函數調用標準化、結構體變量名稱標準化、結構體語句排列順序標準化等等;另外，還增加了位運算標準化、枚舉標準化以及文件的處理;增強學生程序中語法錯誤的檢測和改進程序匹配策略。 -
The following works have been done : ( 1 ) define csl language and complete the lexical analysis and syntactical analysis of it ; ( 2 ) obtain control flow graph ( later referred as cfg ) from abstract syntax tree ( ast ) ; ( 3 ) control dependence analysis of csl ; ( 4 ) system architecture of csl slicing system
內容包括通過語法分析獲得源程序的抽象語法樹，從抽象語法樹構造控制流圖，在控制流圖上做控制流分析獲得源程序的控制依賴關系，在控制流圖上做數據流分析獲得源程序的數據依賴關系，以及最後獲得源程序的程序依賴圖並以圖可達性演算法獲得程序分片的全過程。 -
In this paper, we firstly study two wcet analysis methods ( control flow graph based wcet analysis method and syntax tree based wcet analysis method ), and get integrated comprehension on the static wcet analysis
本文首先研究了兩種wcet分析方法（基於控制流圖的wcet分析方法和基於語法樹的wcet分析方法） ，加深了對靜態wcet分析的理解。 -
In the design of crossover, we first merge two parent trees to a graph, and then create a multicast tree from the graph. based on the method, the algorithm have a good performance of crossover
在雜交運算元的設計上，通過對兩個父代個體結合，然後再生成組播樹的方法，使演算法具有較好的雜交性能。 -
A query tree can be got from the query decomposing rules, and a query graph can be generated by optimizing the query tree and applying the arithmetic of generating a query graph. at last, a query plan will be generated by using kruskal heuristic arithmetic two times on query scheduler and sub - query combination
通過查詢分解規則可得到查詢樹，對查詢樹進行分解優化並按照查詢圖生成演算法可得到一個查詢圖，然後兩次運用kruskal啟發式演算法對查詢調度和子查詢合併進行了優化，最後產生查詢計劃。 -
In order to build the function model for the mold enterprise, according to the idefo method, functions of the mold enterprise were divided from top to bottom, and the function trees such as the management function tree, the technology function tree and the manufacturing function tree were established respectively. based on those trees, the top - layer idefo function graph, o - layer idefo function graph, etc. were set up, in order to build the information model, following processes had been done : 1
鄭州大學碩士學位論文按照idefo方法，本文首先將模具企業自頂向下按遞階層次進行功能分解，劃分為經營管理、工程技術分析與模具製作三方面，對這三個方面進行分析與細分后，可以分別得到其功能模型功能樹圖，對各功能樹繼續採用idefo方法，可以繪制出包括企業功能模型頂層idefo圖、企業功能模型0層idefo圖等各級功能模型圖，從而完成系統功能模型的建立。 -
Nowadays, concerning the relaxed game chromatic number of tree, out - erplanar and partial k - tree graph have been studied by many researchers home and abroad, this paper studies further the relaxed game chromatic number of trees
如今，關于樹，外平面圖及偏k -樹的鬆弛競賽染色已引起眾多學者的研究，本文主要研究森林的鬆弛競賽色數。
分享友人