path graph 中文意思是什麼
path graph
解釋
路徑圖-
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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。 -
Augmenting path graph
增廣路徑圖 -
Claw - free graphs have been a subject of interest of many authors in the recent years. the first motivation for studying properties of claw - free graphs apparently appeared from the beineke ' s characterization of line graphs in [ 4 ], [ 5 ]. however, the main impulse that turned the attention of the graph theory community to the class of claw - free graphs was given in late 70s and early 80s. during the period some first results on hamiltonian properties were proved in [ 6 ], [ 7 ], [ 8 ], [ 9 ]. prom then on, more and more authors began to study the problem of hamilton. they studied mainly in the following two aspects : cycle aspect and path aspect. we may obtain some results about cycle in [ 3 ] and [ 10 - 30 ]
研究該圖類的最初動機來源於deineke [ 4 ] ， [ 5 ]線圖的特性，然而引起人們尤其注意是在70年代末80年代初，整個這個時期在[ 6 ] ， [ 7 ] ， [ 8 ] ， [ 9 ]中關于哈密頓性質的一些初步結果被證明從此用無爪圖來研究哈密頓問題日益活躍，人們主要從以下兩個方面來研究：圈方面和路方面其中關于圈方面的部分結果可參見文獻[ 3 ]及[ 10 - 30 ]等 -
Especially a kind of " intelligent " automatic graphical creation of bond graph method is presented by introducing graph theory and artificial intelligence technique. this method not only improves efficiency of model input and foundation but also breaks an mformation transform path from hydraulic principle figure, bond graph model to the descriptive file
特別是通過圖論和人工智慧技術的引入，提出了一種「智能型」鍵合圖圖形自動生成方法，在顯著加快鍵合圖模型輸入與建立效率的同時，開辟了液壓原理圖及鍵合圖模型與描述文件信息轉換的通道。 -
To analyze some key technologies of optical network relative with rwa in detail, such as transmission, switching and internetworking ; to emphasize on the research of function, fabric and performance of optical cross - connection ; to carry out numerical simulations for crosstalk introduced by optical cross connect and to present measurements for suppressing it such as doubly filtering, fixing optimum decision threshold and appropriately choosing the number of multiplexed wavelengths ; 3. to research the fundamental principle and some problems relative with rwa, including the type of optical network, the type of traffic, the type of service, the survivability of optical network ; to classify and compare rwa algorithms and particularly research some dynamic rwa algorithms ; 4. to present reserved light - path and classify network resource such as used, unused and reserved status, to emulate establishment of all - optical connection in optical network through modified rwa algorithm and show effectively reducing setup time of all - optical connection utilizing reserved light - path ; to research rwa algorithms of multi - fiber network, to present new link weight functions dependent on node degree, unused fiber ( s ) per wavelength - layer and routing policies, to perform emulation of rwa based wavelength layer graph applying new link weight functions and show them make algorithms better performance and network lower blocking rate ; 5
詳細分析了與rwa相關的光網路關鍵技術，包括傳輸、交換、組網等，重點研究了光交叉連接的功能和結構、性能，對其引入的串擾進行了詳細分析，選擇恰當的器件參數進行了數值模擬，並提出了抑制措施（如雙重濾波、優化判決門限、選擇恰當的復用波長數） ; 3 .研究了光網路的r認叭的基本原理、與r認叭的幾個相關問題（光網路類型、業務類型、流量類型、光網路生存性） 、 r認人演算法的分類和比較，具體研究了幾種動態r場人演算法; 4 .研究了以全光連接建立時間為優化目標的r認認演算法，提出預置光路的概念，對網路資源進行狀態分類（佔用、未佔用、預置） ，利用改進的r認叭演算法模擬，預置光路可為部分新到的連接請求快速建立連接，從而提高網路性能;研究了以多光纖網路連接阻塞率為優化目標的r認城演算法，提出了以節點度數、每個波長分層的空閑光纖數以及路由策略決定的幾種鏈路權重函數，利用基於波長分層圖模型的并行r場人演算法模擬，利用新的鏈路權重函數使得演算法具有更優的性能，使網路具有更低的連接阻塞率。 -
By programming developed by user, the paper detailed researches the expressing method and identifying method of the component in the hierarchy assembly model, the description of three dimension position and orientation of the components in the product, and topological graph of mating relationship among the components. all these lay a solid foundation for the following research on assembly sequence and path planning and assembly process simulating
本文在pro engineer軟體的基於特徵的參數化技術建模的基礎上，通過其二次開發平臺，詳細研究了pro e軟體環境下的裝配模型的層次結構的裝配模型表達方法和部件標識機制，以及零部件在裝配體中的空間位姿描述；還有零部件之間的配合聯接關系的拓撲圖表示法。 -
Based on the analysis and research of current development of geographical network analysis, we summarize the limitation o f current research, and put forward making a geographical network analysis component with component technology, this method realizes geographical network analysis arithmetic and its values, improve the reuse of arithmetic. this method remedy mapx, mo etc gis component ' s geographical network analysis functipn, it also can resolve requirements for short path analysis, locating and servering analysis, material flowing analysis and connectivity analysis, at the same time this method is a beneficial reference for other gis component " design and realization. after mastered correlative theories and arithmetics, using com technology, we realize a geographical network analysis component, and apply it in system for flood material dispatch. the main content and work can be summarized as flows : 1. based on graph network model, we analysis and sum up geographical network analysis model and arithmetic, discuss the most important arithmetic - dijkstra arithmetic and improve it
通過該思路不僅使研究成果得以應用，體現其價值，也提高了演算法的重用性；開發出來的地理網路分析控制項彌補了當前mapx 、 mo等基礎gis組件的地理網路分析功能，利用該控制項也能解決現實中對路徑分析、選址服務分析、物流分析、連通性分析等地理網路分析的迫切需求，同時該思路對gis組件設計開發也是一個有益的參考。本文在掌握相關理論和演算法基礎上，利用com技術實現了地理網路分析控制項，並在防汛物資調度系統中進行應用。本文主要內容和工作如下： 1 、以圖論中的網路模型為參考，分析總結了幾類基本的地理網路分析模型及演算法，對其中的核心演算法? ? dijkstra演算法進行了分析探討，並對該演算法進行了改進。 -
The wiener index of peptoids, when the fragment graph is a path, has been calculated, see the reference [ 40 ]. we study the wiener index of peptoids, when the fragment graph is more complicated : a complete graph, a wheel, a cycle and a circulant graph. we get the exact expressions for them
有關類肽圖的骨架圖為路徑時的wiener數的計算結果已經有了，我們研究的骨架圖為比較復雜的幾個：完全圖、輪、圈和循環圖等，並獲得了它們的wiener數的顯式表達式。 -
Then we discuss eight properties of basis graph of quasi - fuzzy graph matroid. they demonstrate connection properties, vertex distance, determining the label numbers of the vertices and path existing properties
這八條性質定理分別討論的是準模糊圖擬陣的基圖的連通性，頂點距離計算的充要條件，頂點標號的確定，路的存在性。 -
The continually optimized connecting relation is gained via perceptron and xor function, then the optimal path graph is found
利用感知器異或函數獲得了節點之間不斷優化的連接關系，然後得到最優路徑圖。 -
Then g contains a y - longest path p ( x0, y ) such that d ( x0 ) if g has one. we discuss the structure of graph satisfying the conditions in theorem a and give the extremal graph
… y ）滿足d （ oo ）三號我們對滿足超a條件的圖的結構進行了討論，給出了m極圖 -
Neither eular circuit nor eular path exists in this graph, since there are more than two vertices with odd degree
這個圖既沒有歐拉迴路，也沒有歐拉路徑。因為有超過兩個頂點的度數為奇數。 -
Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, aov and aoe network
圖的概念和實現；圖的基本操作；最小價值生成樹；最短路徑；活動網路。 -
The algorithm makes use of the node - arc structure of graph and depth - first - search, have realized the retrieval of optimum path in virtual navigation
該演算法以圖的節點?弧段結構結合深度優先搜索實現了自動游覽中最優路徑的檢索。 -
Based the format of plt file made by the coreldraw graph software. pick - up vector position coordinate of the file, the imitate process is written in the soft, and edit the graph simply, such as move, rotate, zoom and portrait array. transforming plt file into numeral control file, and appointing the file path is c : / / l. nc
基於coreldraw圖形軟體生成的plt文件格式，提取文件的矢量位置坐標，在軟體編程中加入模擬過程，並且能對列印圖形做簡單的編輯操作，例如平移、旋轉、縮放和縱向排列等，將plt文件轉換成數控文件，指定文件路徑為c ： / / 1 . nc 。 -
( 2 ) utilizing the shortest path algorithm in graph theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part
（ 2 ）運用圖論中的最短路徑搜索演算法從裝配模型中自動搜索出功能約束尺寸鏈，確定零件的功能尺寸。 -
A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices
圖中經過三個以上頂點且經過每個頂點僅一次的一條封閉路徑。 -
Optical cross - connector ; graph ; blocking ; light path algorithm
光交叉互連圖阻塞路由演算法 -
So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm
本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。 -
Hamilton problem is one of fundamental problems in graph theory, the following aspects are mainly focused on : cycle problem and path problem. in detail, they are mainly problems of hamilton cycle, cycle extensibility, longest cycle and hamilton path, hamilton - connectivity, panconnectivity, path extensibility, longest path etc. as to hamilton cycle problem, we have got many results
Hamilton問題是圖論研究的基本問題之一，主要集中在以下兩個方面：圈問題和路問題，具體地講主要有： hamilton圈問題，圈可擴性問題，最長圈問題等以及hamilton路問題， hamiltonj ji問題，泛溯問題，路可擴性問題，最長路問題等
分享友人