實(shí)用英語(yǔ):計(jì)算機(jī)-數(shù)據(jù)結(jié)構(gòu)基本英語(yǔ)(3)

字號(hào):

圖 graph
    子圖 subgraph
    有向圖 digraph(directed graph)
    無(wú)向圖 undigraph(undirected graph)
    完全圖 complete graph
    連通圖 connected graph
    非連通圖 unconnected graph
    強(qiáng)連通圖 strongly connected graph
    弱連通圖 weakly connected graph
    加權(quán)圖 weighted graph
    有向無(wú)環(huán)圖 directed acyclic graph
    稀疏圖 spares graph
    稠密圖 dense graph
    重連通圖 biconnected graph
    二部圖 bipartite graph
    邊 edge
    頂點(diǎn) vertex
    弧 arc
    路徑 path
    回路(環(huán))cycle
    弧頭 head
    弧尾 tail
    源點(diǎn) source
    終點(diǎn) destination
    匯點(diǎn) sink
    權(quán) weight
    連接點(diǎn) articulation point
    初始結(jié)點(diǎn) initial node
    終端結(jié)點(diǎn) terminal node
    相鄰邊 adjacent edge
    相鄰頂點(diǎn) adjacent vertex
    關(guān)聯(lián)邊 incident edge
    入度 indegree
    出度 outdegree
    最短路徑 shortest path
    有序?qū)?ordered pair
    無(wú)序?qū)?unordered pair
    簡(jiǎn)單路徑 simple path
    簡(jiǎn)單回路 simple cycle
    連通分量 connected component
    鄰接矩陣 adjacency matrix
    鄰接表 adjacency list
    鄰接多重表 adjacency multilist
    遍歷圖 traversing graph
    生成樹(shù) spanning tree
    最?。ù鷥r(jià))生成樹(shù) minimum(cost)spanning tree
    生成森林 spanning forest