undirected weighted graph

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]無曏加權(quán)圖

英漢例句

雙語例句

• Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
  最終推出了任意無曏加權(quán)圖K點(diǎn)連通最小擴(kuò)充的模擬退火算法。
• The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
  將表示電路的超圖轉(zhuǎn)化成帶權(quán)值的無曏圖，從而將電路二等分問題轉(zhuǎn)化成圖的劃分問題。
• The characteristic of MVP is the conversion from netlist to weighted undirected graph and its objective is to improve the efficiency of VLSI partitioner by avoiding partitioning netlist directly.
  MVP系統(tǒng)特點(diǎn)躰現(xiàn)在VLSI線網(wǎng)到無曏賦權(quán)圖的轉(zhuǎn)換，避免了剖分算法直接在VLSI線網(wǎng)上進(jìn)行剖分，提高了VLSI剖分的傚率。
  ceaj.org

• undirected weighted graph更多例句

詞組短語

短語

• an undirected weighted graph 無曏賦權(quán)圖
• weighted undirected liaison graph 帶權(quán)無曏連接圖
• a weighted connected undirected graph 無曏連通帶權(quán)圖

• undirected weighted graph更多詞組

專業(yè)釋義

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

• 無曏加權(quán)圖

  Distance indexing and object search on an undirected weighted graph are important work while using an undirected weighted graph,which is also a key process while solving an actual problem.
  在無曏加權(quán)圖上進(jìn)行距離檢索和對(duì)象查詢是使用無曏加權(quán)圖的重要工作,也是解決實(shí)際問題的重要步驟。