有向圖無向圖 的英文怎麼說

中文拼音 [yǒuxiàngtúwúxiàngtú]
有向圖無向圖 英文
directed graph undirected graph
  • 有 : 有副詞[書面語] （表示整數之外再加零數）: 30 有 5 thirty-five; 10 有 5年 fifteen years
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 3...
  • 無 : 無Ⅰ動詞（沒有） not have; there is not; be without Ⅱ名詞1 （沒有） nothing; nil 2 （姓氏） a surn...
  1. After crossing by a forced march behind pahra to the tula road, the generals of the russian army intended to remain at podolsk, and had no idea of the tarutino position. but an infinite number of circumstances, among them the reappearance of french troops on the scene, and plans for giving battle, and most of all, the abundance of supplies in kaluga, led our army to turn even more to the south, and to pass from the tula to the kaluga road to tarutino, a central position between their lines of communication with their supplies

    冒險渡過帕赫拉河向圖拉大路運動時，俄國軍隊的司令官們曾打算在波多爾斯克停留下來，並沒有考慮塔魯丁諾陣地，但是，無數的情況和先前不知俄國軍隊蹤跡的法國軍隊的再次出現作戰計劃主要是卡盧加的糧秣充足，迫使俄軍向南移動，向給養所在地的交叉路口轉移，從圖拉大路轉到卡盧日斯卡雅大路，直趨塔魯丁諾。
  2. Just as nb antenna array the pattern of uwb tem - horn antenna array is concern with the number and distance of elements at which the pattern lie in

    陣列某一面方向圖僅與這一面的單元個數及單元間距有關與其它面的陣列單元個數和單元間距無關。
  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. All graphs considered in this paper are finite, undirected and simple

    本文僅討論有限，無向，簡單圖
  6. Graphs studied in this dissertation are finit, simple, undirected graphs

    本文所涉及的圖均為無向、簡單的有限圖。
  7. Arithmetic is divided into some basic units, such as analog input unit, digital input unit, calculated unit etc. a series of unit were connected by the input and output relation between them

    本文將監控過程中的演算法分解為通過輸入輸出介面進行連接的獨立環節，並將環節組合抽象為有向無環圖。
  8. Directed acyclic graph

    有向無環圖
  9. A file format is proposed based on the generic model and iso base media file format. we first create a directed acyclic graph model to describe the substreams and relationships among those substreams in a scalable video stream

    本文首先建立了一個有向無環圖模型，該模型能夠描述可擴展視頻編碼碼流中各子碼流和子碼流間復雜的依賴關系。
  10. Based on the available resources mapping algorithm using the directed acyclic graph, a new dynamic resource co - allocation algorithm is proposed to solve the dynamic problem of the resource co - allocation in the grid

    摘要針對網格系統中資源協同分配的動態性問題，分析了現有的基於有向無環圖的資源映射方法，提出了一種動態資源協同分配演算法。
  11. The graphs which we consider here are finite, undirected, simple and loopless

    這里考慮的圖是有限的、無向的、無圈的簡單圖。
  12. 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猜想研究有向圖中存在有向三角形的條件，受此啟發，我們在有點向圖中引入結合數的概念。
  13. The theory of graphs can be roughly partitioned into two branches : the areas of undirected graphs and directed graphs ( digraphs )

    圖論大致可分為兩個方向：無向圖與有向圖。
  14. But most of their results are limited on non - directed graphs and integral trees, and few works about integral directed graphs are obtained

    但是，其中的大部分結果是關于無向圖和整樹的，對于有向圖的整性的研究，卻十分地欠缺。
  15. 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

    首先，我們探討了用於推斷基因表達調控網路的一些常用模型，加權矩陣模型、布爾網路模型、互信息關聯網路模型、線性組合模型、有向圖和無向圖以及貝葉斯網路模型。逐個分析了每種方法的優缺點。
  16. 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的可靠度而得到。
  17. This paper consists of two chapters : chapter i is about digraph theory and chapter ii is about infinite - dimensional linear system theory

    本文分別在第一章與第二章討論有關有向圖與無窮維線性系統的具體問題。
  18. In this paper we deal with two aspects of applied mathematics, one is digraph theory and the other is infinite - dimensional linear system theory

    本文將研究兩個方面的內容：有向圖理論與無窮維線性系統。這兩個方面是應用數學中的兩個非常重要的研究領域。
  19. The paper discusses the research on collaborative design, engineering database theories and collaborative environments of engine cad, introduces the backstage dbms ? oracle particularly. version management mechanism of engine cad engineering databases is given out through the analysis and research on the using version management mechanism and models, which using dag models and parted database version blocks

    通過對現有的版本管理機制和版本管理模型的分析與研究，並結合實際，提出了發動機cad工程數據庫的版本管理機制，採用有向無循環圖（ dag ）版本管理模型，對數據庫版本按塊劃分的版本管理機制。
  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

分享到臉書