计算机-数据结构基本英语(3)
英语课
图 graph
子图 subgraph
有向图 digraph(directed graph)
无向图 undigraph(undirected graph)
完全图 complete graph
连通图 connected graph
非连通图 unconnected graph
强连通图 strongly connected graph
弱连通图 weakly connected graph
加权图 weighted graph
有向无环图 directed acyclic graph
稀疏图 spares graph
稠密图 dense graph
重连通图 biconnected graph
二部图 bipartite graph
边 edge
顶点 vertex
弧 arc
路径 path
回路（环）cycle
弧头 head
弧尾 tail
源点 source
终点 destination
汇点 sink
权 weight
连接点 articulation point
初始结点 initial node
终端结点 terminal node
相邻边 adjacent edge
相邻顶点 adjacent vertex
关联边 incident edge
入度 indegree
出度 outdegree
最短路径 shortest path
有序对 ordered pair
无序对 unordered pair
简单路径 simple path
简单回路 simple cycle
连通分量 connected component
邻接矩阵 adjacency matrix
邻接表 adjacency list
邻接多重表 adjacency multilist
遍历图 traversing graph
生成树 spanning tree
最小（代价）生成树 minimum(cost)spanning tree
生成森林 spanning forest
子图 subgraph
有向图 digraph(directed graph)
无向图 undigraph(undirected graph)
完全图 complete graph
连通图 connected graph
非连通图 unconnected graph
强连通图 strongly connected graph
弱连通图 weakly connected graph
加权图 weighted graph
有向无环图 directed acyclic graph
稀疏图 spares graph
稠密图 dense graph
重连通图 biconnected graph
二部图 bipartite graph
边 edge
顶点 vertex
弧 arc
路径 path
回路（环）cycle
弧头 head
弧尾 tail
源点 source
终点 destination
汇点 sink
权 weight
连接点 articulation point
初始结点 initial node
终端结点 terminal node
相邻边 adjacent edge
相邻顶点 adjacent vertex
关联边 incident edge
入度 indegree
出度 outdegree
最短路径 shortest path
有序对 ordered pair
无序对 unordered pair
简单路径 simple path
简单回路 simple cycle
连通分量 connected component
邻接矩阵 adjacency matrix
邻接表 adjacency list
邻接多重表 adjacency multilist
遍历图 traversing graph
生成树 spanning tree
最小（代价）生成树 minimum(cost)spanning tree
生成森林 spanning forest