| 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 | 有向无环图 |
| sparse 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 | 生成森林 |
| topological sort | 拓扑排序 |
| partial order | 偏序 |
| topological order | 拓扑有序 |
| activity on vertex network (AOV) | AOV网 |
| activity on edge network (AOE) | AOE网 |
| critical path | 关键路径 |
| matching | 匹配 |
| maximum matching | 最大匹配 |
| augmenting path | 增广路径 |
| augmenting path graph | 增广路径图 |