undirected weighted graph
基本解釋
- [計(jì)算機(jī)科學(xué)技術(shù)]無(wú)向加權(quán)圖
英漢例句
- Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最終推出了任意無(wú)向加權(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)值的無(wú)向圖,從而將電路二等分問(wèn)題轉(zhuǎn)化成圖的劃分問(wè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)到無(wú)向賦權(quán)圖的轉(zhuǎn)換,避免了剖分算法直接在VLSI線網(wǎng)上進(jìn)行剖分,提高了VLSI剖分的效率。
ceaj.org
雙語(yǔ)例句
詞組短語(yǔ)
- an undirected weighted graph 無(wú)向賦權(quán)圖
- weighted undirected liaison graph 帶權(quán)無(wú)向連接圖
- a weighted connected undirected graph 無(wú)向連通帶權(quán)圖
短語(yǔ)
專業(yè)釋義
- 無(wú)向加權(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.
在無(wú)向加權(quán)圖上進(jìn)行距離檢索和對(duì)象查詢是使用無(wú)向加權(quán)圖的重要工作,也是解決實(shí)際問(wèn)題的重要步驟。