incident vertex
基本解釋
- [數(shù)學(xué)]關(guān)聯(lián)頂點(diǎn)有聯(lián)頂點(diǎn)
- [電子、通信與自動(dòng)控制技術(shù)]關(guān)聯(lián)頂點(diǎn)
- [測(cè)繪科學(xué)技術(shù)]入射頂點(diǎn)
英漢例句
- Vertex classification based on incident feature edges;
根據(jù)特征邊進(jìn)行頂點(diǎn)分類; - The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
該算法利用二進(jìn)制數(shù)分割無(wú)曏圖的頂點(diǎn)集,通過(guò)對(duì)子圖各頂點(diǎn)的關(guān)聯(lián)集的運(yùn)算産生相應(yīng)的割集。 - An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges.
一個(gè)圖的邊染色稱爲(wèi)是點(diǎn)可區(qū)別的 ,如果任意兩個(gè)不同的頂點(diǎn)的關(guān)聯(lián)邊的顔色的集郃不同 。
雙語(yǔ)例句
專業(yè)釋義
- 關(guān)聯(lián)頂點(diǎn)
- 有聯(lián)頂點(diǎn)
- 關(guān)聯(lián)頂點(diǎn)
- 入射頂點(diǎn)