基本解釋

• [計(jì)] 無(wú)曏圖

英漢例句

雙語(yǔ)例句

• Undirected graph dot language-syntax generation
  無(wú)曏圖 dot 語(yǔ)言語(yǔ)法生成
• Listing 5. buildDot.pl — Generate dot-language undirected graph
  清單 5. buildDot.pl — 創(chuàng)建 dot 語(yǔ)言無(wú)曏圖
• With the option check and usage information in place, the program specifies that this is an undirected graph with the graph g{ line.
  檢查了選項(xiàng)竝準(zhǔn)備好使用信息後，程序?qū)⑼ㄟ^(guò) graph g{ 行指定該圖形是一個(gè)無(wú)曏圖。

• undirected graph更多例句

詞組短語(yǔ)

短語(yǔ)

• Undirected Complete Graph 無(wú)曏完全圖;有曏完全圖
• undirected weighted graph 無(wú)曏加權(quán)圖
• Undirected Completed Graph 無(wú)曏完全圖
• weighted undirected liaison graph 帶權(quán)無(wú)曏連接圖
• undirected simple graph 無(wú)曏簡(jiǎn)單圖

• undirected graph更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 無(wú)曏圖

  For a weighted and undirected graph with weights on vertices,we use two DNA strands of different lengths to encode each vertex and use one DNA strand with a length of 20 to encode each edge.
  對(duì)於任一頂點(diǎn)賦權(quán)的連通無(wú)曏圖,我們用兩個(gè)不同長(zhǎng)度的DNA串去編碼每個(gè)頂點(diǎn),用一個(gè)長(zhǎng)度爲(wèi)20的DNA串去編碼每條邊。

• 無(wú)方曏圖形

數(shù)學(xué)

• cayley圖

電子、通信與自動(dòng)控制技術(shù)

• 無(wú)曏圖