?digraph

digraph 發(fā)音

英：['da?grɑ?f]　　美：['da?ɡr?f]

英：　　美：

digraph 中文意思翻譯

digraph 短語(yǔ)詞組

1、converse digraph ─── 反向圖

2、disconnected digraph ─── [計(jì)] 不連通有向圖

3、contrafunctional digraph ─── [計(jì)] 逆函數(shù)有向圖

4、cospectral digraph ─── [計(jì)] 同譜在向圖

5、strictly weak digraph ─── [計(jì)] 嚴(yán)格弱有向圖

6、unilateral connected digraph ─── [計(jì)] 單側(cè)連通有向圖

7、acyclic digraph ─── [計(jì)] 無圈有向圖, 非循環(huán)有向圖

8、symmetric digraph ─── [計(jì)] 對(duì)稱有向圖

9、trivial digraph ─── [計(jì)] 平凡有向圖

10、unilateral digraph ─── [計(jì)] 單側(cè)有向圖

11、strong digraph ─── [計(jì)] 強(qiáng)有向圖

12、Eulerian digraph ─── [計(jì)] 歐拉有向圖

13、Euler digraph ─── [計(jì)] 歐拉有向圖

14、labelled transitive digraph ─── [計(jì)] 標(biāo)定可遷有向圖

15、primitive digraph ─── [計(jì)] 原始有向圖

16、arc-digraph ─── [計(jì)] 弧有向樹

17、strictly-unilateral digraph ─── [計(jì)] 嚴(yán)格單側(cè)有向圖

18、strongly-connected digraph ─── [計(jì)] 強(qiáng)連通有向圖

19、complete digraph ─── 完全有向圖

digraph 詞性/詞形變化，digraph變形

形容詞: digraphic |

digraph 相似詞語(yǔ)短語(yǔ)

1、biograph ─── v.給……寫傳記；n.（初期的）電影放映機(jī)

2、airgraph ─── n.拍照航空信

3、odograph ─── n.里程表；[測(cè)]步程計(jì)；記步器

4、digraphic ─── 數(shù)字的

5、idiograph ─── n.商標(biāo)；標(biāo)記；個(gè)人簽名

6、diagraph ─── n.作圖器；分度尺；原圖放大繪圖器

7、diagraphs ─── n.作圖器；分度尺；原圖放大繪圖器

8、epigraph ─── n.題詞；碑文；銘文

9、digraphs ─── [數(shù)]有向圖

digraph 常見例句（雙語(yǔ)使用場(chǎng)景）

1、- transfonmation digraph ─── 有向Z-變換圖

2、A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs. ─── 摘要 用一條弧或一對(duì)方向相反的弧代替完全多部無向圖的每一條邊所得到的有向圖被稱為是半完全多部有向圖。

3、strictly weak digraph ─── 嚴(yán)格弱有向圖

4、Secondly, by analyzing the characteristic of ants system, we make ants connect the similar data. We advance an adaptive ant clustering algorithm based on digraph(A3CD) which is more direct and easier. ─── 其次,我們通過分析蟻群系統(tǒng)中螞蟻的特點(diǎn),將螞蟻?zhàn)鳛橄嗨茢?shù)據(jù)的連接者,提出了一種更為簡(jiǎn)單的基于有向圖的自適應(yīng)螞蟻聚類算法A3CD。

5、strong digraph ─── 強(qiáng)雙圖

6、two -colored digraph ─── 雙色有向圖

7、Convergence Time of BGP Based on Dispute Digraph ─── 基于有向競(jìng)爭(zhēng)圖的BGP收斂時(shí)間

8、A digraph D is unilateral ─── 圖D是單連的。

9、weakly distance-regular digraph ─── 弱距離正則圖

10、In this paper, we provide a necessary condition and several sufficient conditions for a digraph to have a pair of disjoint quasi-kernels. ─── 在這篇文章中，我們給出了一個(gè)有向圖有一對(duì)不相交的準(zhǔn)核的一個(gè)必要條件和若干充分條件。

11、primitive digraph ─── 基本雙圖本原有向圖

12、complete asymmetric digraph ─── 完全非對(duì)稱有向圖

13、In this digraph, the object that root acme can amount to is effective object, GC will not reclaim these objects. ─── 在這個(gè)有向圖中，根頂點(diǎn)可達(dá)的對(duì)象都是有效對(duì)象，GC將不回收這些對(duì)象。

14、A digraph D is hamiltonian if D contains a hamilton directed cycle. ─── 如果D中含有一個(gè)哈密爾頓有向圈,則稱D為哈密爾頓有向圖。

15、Digraph Switching IMM Algorithm Based Current Statistical Model ─── 基于當(dāng)前統(tǒng)計(jì)模型的有向圖切換IMM算法

16、strictly-unilateral digraph ─── [計(jì)] 嚴(yán)格單側(cè)有向圖

17、Hamiltonian digraph ─── Hamilton圖

18、disconnected digraph ─── 不連通的二圖形

19、Generation Method of Synchronous Test Sequence Based on Synchronous Digraph ─── 基于同步有向圖的同步測(cè)試序列生成方法

20、strictly unilateral digraph ─── 嚴(yán)格單側(cè)有向圖

21、operation digraph ─── 工步有向圖

22、unilateral connected digraph ─── 單側(cè)連通有向圖

23、A mathematic model is built,a digraph.Using set theory to analyse the digraph model,some results are obtained in electro-ducument-process. ─── 文中應(yīng)用集合理論對(duì)有向圖模型進(jìn)行了分析,獲得了一些公文流程電子化的理論結(jié)果。

24、Extended locally in (out)-semicomplete digraph is an important generation of semicomplete digraph. ─── 擴(kuò)張的局部?jī)?nèi)（外）半完全有向圖是半完全有向圖的一個(gè)重要的推廣圖類。

25、In this paper,we provide a necessary condition and several sufficient conditions for a digraph to have a pair of disjoint quasi-kernels. ─── 在這篇文章中,我們給出了一個(gè)有向圖有一對(duì)不相交的準(zhǔn)核的一個(gè)必要條件和若干充分條件.

26、The Signed Digraph Model of Anti-tactic Ballistic Missile Flight Aided by Military Satellite System ─── 軍事衛(wèi)星支援下軍事衛(wèi)星支援下

27、class cover problem(CCP); class cover catch digraph(CCCD); particle swarm optimization(PSO); fuzzy neural network; fuzzy input space partitioning; greedy algorithm ─── 關(guān)鍵詞類覆蓋問題；類覆蓋獲取有向圖；粒子群優(yōu)化；模糊神經(jīng)網(wǎng)絡(luò)；模糊輸入空間劃分；貪心算法

28、weakly connected digraph ─── 弱連通有向圖

29、(sh.) contrafunctional digraph ─── 反函數(shù)的雙圖, 逆函數(shù)有向圖

30、converse digraph ─── 反向圖

31、functional digraph ─── 函數(shù)圖形函數(shù)雙圖形函數(shù)有向圖

32、A Model for Measurement of Organizational Knowledge Based on Acyclic Digraph ─── 一種基于有向無環(huán)圖的組織知識(shí)度量模型

33、ON ARC-TRANSITIVE CAYLEY DIGRAPH OF ABEL GROUPS ─── Abel群上的弧傳遞Cayley有向圖

34、A Note to Power Convergence Exponent of Line Digraph ─── 關(guān)于線有向圖冪斂指數(shù)的一個(gè)注記

35、We shall abbreviate "directed graph" to digraph ─── 我們將把“有方向的圖”簡(jiǎn)稱為方向圖。

36、)Note that if not all of the streets are one-way,then we can obtain a digraph by drawing for each two-way road two directed edges,one in each direction. ─── )請(qǐng)注意，如果并非所有的道路都是單行道，那么我們可以在圖中為每一條雙行道畫兩條有向邊，每條邊指明一個(gè)方向。

37、symmetric digraph ─── 對(duì)稱有向圖

38、pseudo-symmetric digraph ─── 偽對(duì)稱有向圖

39、Mutual placement of a kind of digraph ─── 一類有向圖的可嵌入性

40、cospectral digraph ─── 余譜雙圖同譜有向圖

41、The eccentric digraph ED(G) of G is the digraph that has the same vertex set as Gand the arc set defined by : there is an arc from u to v if and only if v is an eccentricvertex of u . ─── 定義G的離心圖(eccentric digraph)如下:頂點(diǎn)集為V (G) ,弧集滿足:有一條弧從v到u當(dāng)且僅當(dāng)頂點(diǎn)u是v的一個(gè)離心點(diǎn),記為ED(G)。

42、The kings prblems in semicomplete digraphs without vertices whose in-degree are zero and locally semicomplete digraph under some conditions are discussed chiefly in the paper. ─── 其中,主要討論了不包含內(nèi)度為零的頂點(diǎn)的半完全有向圖和滿足若干條件下的局部半完全有向圖中王的問題。

43、transitive digraph ─── 可遷有向圖

44、The second is to locate the ones which are isolated in the instant-center digraph or those which are not within any instant-center circuit. ─── 第二種情況則是求取瞬心有向圖中的孤立瞬心或不在任何迴圈之中的瞬心座標(biāo)。

45、A New Decomposing Algorithm of BCNF Based on Digraph of Key of Subschema ─── 一個(gè)基于關(guān)鍵字有向圖的BCNF分解新算法

46、one-way sub- digraph ─── 單向分圖

47、Operator recognizes that the single digraph character and the two individual characters are equivalent. ─── 運(yùn)算符認(rèn)為該單個(gè)二合字母字符與這兩個(gè)單獨(dú)的字符是等效的。

48、complete symmetric digraph ─── 完全對(duì)稱有向圖

49、We shall abbreviate "directed graph" to digraph. ─── 我們將把“有方向的圖”簡(jiǎn)稱為方向圖。

50、Abstract： By using the matrix representation of a digraph, some results about the index of convergence and period of a line digraph are obtained. ─── 摘 要： 采用有向圖的矩陣表示，得到了線有向圖的冪斂指數(shù)和周期的有關(guān)結(jié)果.

51、When a language that uses a digraph character is specified in the system locale settings, an occurrence of the single digraph character in either ─── 當(dāng)在系統(tǒng)區(qū)域設(shè)置中指定使用二合字母字符的語(yǔ)言時(shí),在

52、The Optimal Decision-making for Logistics Paths with Planning Digraph and Its Application ─── 基于有向圖規(guī)劃的最佳物流路徑策略分析及應(yīng)用

53、hierarchical digraph ─── 分級(jí)圖形

54、By using the matrix representation of a digraph, some results about the index of convergence and period of a line digraph are obtained. ─── 摘要采有有向圖的矩陣表示，得到了線有向圖的冪斂指數(shù)和周期的有關(guān)結(jié)果。

55、This paper concerns a kind of the best decision making for logistics paths with planning digraph and its application. ─── 本文著重討論基于有向圖規(guī)劃的最佳物流路徑策略分析及應(yīng)用。

56、Euler digraph ─── [計(jì)] 歐拉有向圖

57、weight digraph ─── 加權(quán)有向圖

58、trivial digraph ─── 平凡雙圖平凡有向圖

59、unilateral digraph ─── 單側(cè)有向圖

60、The Index of Convergence of the Total Digraph ─── 全有向圖的冪斂指數(shù)

61、weak digraph ─── 弱雙圖弱有向圖

62、balanced digraph ─── 平衡有向圖

63、Cayley digraph ─── Cayley圖

64、Study of Digraph Corresponding to Prodnct Matrix of Adjaceucy Matrix of Any Two Circulaut Digraph ─── 兩個(gè)有向循環(huán)圖的鄰接矩陣的乘積矩陣對(duì)應(yīng)有向圖的研究

65、strongly connected digraph ─── 強(qiáng)連通有向圖

66、We shall abbreviate the "directed graph" to digraph. ─── 我們將把“有方向的圖”簡(jiǎn)稱為方向圖。

67、Finally, the independent analyses and the connections of the two aspects of digraph is discussed. ─── 最后，對(duì)有向圖的這兩個(gè)方面進(jìn)行了獨(dú)立性分析以及對(duì)這兩方面的聯(lián)系進(jìn)行了論述。

68、three-colored digraph ─── 三色有向圖

69、Various graph algorithms that use the developed digraph in deciding the location of sensors based on the concept of observability and resolution are discussed. ─── 在此基礎(chǔ)之上提出一種改進(jìn)的基于故障診斷的計(jì)算機(jī)程序算法來設(shè)計(jì)傳感器的網(wǎng)絡(luò)分布。

70、If a digraph reversal is present, one letter is most likely a vowel. ─── 如果出現(xiàn)了反向雙字母組合，其中的一個(gè)字母很可能是元音。

71、extended digraph ─── 擴(kuò)張有向圖

72、associated digraph ─── 伴隨有向圖

73、consonantal digraph ─── 二輔音字母組

74、sign digraph ─── 帶號(hào)有向圖

75、Research and application of strongly connected directed digraph with period ─── 帶周期的強(qiáng)連通有向圖的研究與應(yīng)用

76、Appliance of Signed Digraph to the Efficiency Evaluation of Satellite Applications ─── 利用影響圖方法進(jìn)行衛(wèi)星應(yīng)用效能評(píng)估

77、We shall abbreviate "directed graph" to digraph. ─── 行聲明這個(gè)圖為g，并且聲明了該圖的類型(digraph)。

78、'An example of a digraph is given,the directions of the one-way streets being indicatedy by arrows; ─── 例如，我們將討論這樣一些圖，圖中存在包含所有邊或所有頂點(diǎn)一次且僅一次而回到出發(fā)頂點(diǎn)的路，我們分別稱之為歐拉圖和哈密爾頓圖。

79、agent digraph ─── Agent圖

80、fundamental digraph ─── 基本有向圖

81、isometric digraph ─── 同構(gòu)有向圖

82、Special primitive two-colored digraphs whose uncolored digraph consist of two cycles arc considered. ─── 摘要研究一類特殊的本原雙色有向圖，其未著色的有向圖包含兩個(gè)圈。

83、Signed digraph model ─── 影響圖模型

84、The Index of Convergence of A Total Digraph ─── 有向全圖的冪斂指數(shù)和周期

85、Subsequently, the configuration model was formulated through family extension of carrier and manufacturing process nodes along with configuration knowledge extraction and presentation in digraph. ─── 在此基礎(chǔ)上，通過拓展其載體和制造過程節(jié)點(diǎn)，并采用有向圖提取和表達(dá)上述元素間的關(guān)系，生成了包含產(chǎn)品族載體和制造過程信息的配置模型。

86、anti-symmetric signed digraph ─── 反對(duì)稱帶號(hào)有向圖

87、contrafunctional digraph ─── 反函數(shù)的雙圖逆函數(shù)有向圖

88、digraph coding ─── 兩個(gè)字母拼成一個(gè)單音的編碼