無向圖 的英文怎麼說

中文拼音 [wúxiàngtú]
無向圖 英文
non oriented graph
  • 無 : 無Ⅰ動詞（沒有） not have; there is not; be without Ⅱ名詞1 （沒有） nothing; nil 2 （姓氏） a surn...
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 3...
  1. 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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. A circ is an undirected graph having only vertices of even nonzero degree.

    一廣義圈是一無向圖，其頂點次數都是非零偶數。
  3. To avoid detail we shall use the latter symbol for both undirected and directed graphs and rely on the context for clarity.

    為了避免瑣碎，對無向圖和有向圖我們都採用后一符號，而靠上下文加以澄清。
  4. All graphs under consideration are undirected and finite

    本文所考慮的圖皆指有限無向圖且無環。
  5. First, define the palm - line undirected graph according to the palm - lines ’ character

    首先，根據掌紋線的特點，對掌紋線無向圖進行了嚴格定義。
  6. Relations between the concept of nodal point distance and the connectedness of graph, connected component of graph are presented, and a method of how to compute two nodal points distance is also given

    摘要文章分析了無向圖中結點的距離與圖的連通性、圖的鄰接矩陣之間的關系，並且給出了求兩個結點距離的一種方法。
  7. The method first find the vertex aggregate and the edge aggregate primary, then revise them after checking the radian of the palm - line between two vertices, the palm - lines ’ number between two vertices and the distance of the vertices

    該演算法先初步確定無向圖的頂點集和邊集，然後通過考查頂點之間掌紋線的弧度、頂點之間掌紋線的條數和頂點之間的距離對頂點集和邊集進行了適當的修正。
  8. A simple undirect graph x is said to vertex - transitive, edge - transitive, and arc - transitive, if its automorphism group acts transitively on the vertices, edges and arcs, respectively

    如果一個簡單的無向圖的自同構群分別傳遞的作用在它的點集，邊集和弧集上，那麼分別稱這個圖是點傳遞的，邊傳遞的和弧傳遞的。
  9. In chapter 4, the conception of binding number of undirected graphs is introduced to digraphs, based on which the relationship between degree condition of vertices and girth is generalized to the relationship between neighborhood condition of vertices sets and girth

    由於若無向圖g的結合數b （ g ） 3 / 2 ，則g中存在三角形，而caccetta - h （ ? ） ggkvist猜想研究有向圖中存在有向三角形的條件，受此啟發，我們在有點向圖中引入結合數的概念。
  10. Several reliability preserving reductions for the graph g are given

    本文針對網路無向圖g提出的幾種保可靠度縮減原則。
  11. The theory of graphs can be roughly partitioned into two branches : the areas of undirected graphs and directed graphs ( digraphs )

    圖論大致可分為兩個方向：無向圖與有向圖。
  12. Then, advance an algorithm for constructing the palm - line undirected graph according to the connection of the points on the palm - line

    其次，根據掌紋線上各點的連結情況，提出一種掌紋線無向圖的構建演算法。
  13. But most of their results are limited on non - directed graphs and integral trees, and few works about integral directed graphs are obtained

    但是，其中的大部分結果是關于無向圖和整樹的，對于有向圖的整性的研究，卻十分地欠缺。
  14. A simple undirected graph is said to be semisymmetric if it is regular and edge - transitive but not vertex - transitive. this thesis consists of two parts

    如果一個簡單的無向圖是正則的，邊傳遞但不是點傳遞的，那麼稱它是半對稱的。
  15. Observing lots of palm images and their palm - line undirected graph and analyzing the experts ’ knowledge, we extract the recognition features of cross structure and mi structure

    觀察大量的手掌圖像及其相應的掌紋線無向圖，並結合手掌診病專家知識，分別提取出十字紋和米字紋的識別特徵。
  16. Many results on undirected vertex - transitive graphs are applied on directed cases in parallel. and some different conclusions from undirected case are obtained. it is proved that the above two conjectures hold for vertex - digraphs

    我們將許多無向點可遷圖的結果平行地推廣到有向點可遷圖中，同時得到了一些不同與無向圖情形的結論。
  17. Abstract : broadcast networks can be expressed by a simple connected undirected graph

    文摘:將廣播網路用簡單連通的無向圖表示。
  18. Firstly, we study some models which are often used in reconstructing gene regulatory networks, weighed matrices model, boolean networks model, mutual - information networks model, linear combination model, directed graphs and undirected graphs, bayesian networks model and analyze the strengths and weakness of each model by discussing each model ’ s details

    首先，我們探討了用於推斷基因表達調控網路的一些常用模型，加權矩陣模型、布爾網路模型、互信息關聯網路模型、線性組合模型、有向圖和無向圖以及貝葉斯網路模型。逐個分析了每種方法的優缺點。
  19. Using these reductions, firstly some edges of the graph g can be deleted, secondly the resulting graph g1 can be changed to a directed graph g2, thirdly the directed graph g2 can be redacted to a directed graph g3, and finally the reliability of the grapn g can be obtained by appling a sdp algorithm or a factoring algorithm to the directed graph g3

    利用這些原則可以刪去無向圖g中不相關的邊，得到圖g _ 1 ；圖g _ 1經過一系列的轉化，成為有向圖g _ 2 ；對有向圖g _ 2進一步化簡得到有向圖g _ 3 ；最後圖g的可靠度就可以通過求有向圖g _ 3的可靠度而得到。
  20. The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard, and many practical problems can be formulated to it. therefore, studying the mcp is full of significance both in theory and in practice

    最大團問題是一個經典的np難的組合優化問題，很多實際問題都可以抽象為對無向圖上最大團問題的求解，所以，對最大團問題的研究無論在理論上還是實際上都有重要意義。
分享友人
分享到 Line

分享到臉書