- [[图的存储]] * [[邻接表（链式前向星）]] * [[邻接矩阵]]

* [[Floyd算法]] * [[BellMan-Ford算法及其优化]] * [[Dijkstra算法]] * [[K短路问题]] * [[差分约束系统]]

[[图的连通性]]
- [[并查集]]
- [[最小生成树]]
  - [[Kruskal算法]]
  - [[Prim算法]]
- [[Tarjan算法]]
  - [[割点和桥]]
  - [[强连通分量和双联通分量]]
- [[拓扑排序]]
- [[2-SAT]]
[[回路问题]]
- [[Euler回路]]
- [[Hamiltonian回路]]
[[平面图与对偶图]]
[[无向图的三角形枚举]]
[[Graph Realization Problem]]
- [[Graph Realization Problem]]
- [[Digraph Realization Problem]]
[[V图]]
[[图的匹配]]

* [[二分图最大匹配及拓展（Hungarian算法）]] * [[二分图最优匹配及拓展（KM算法）]] * [[一般图最大匹配及拓展（带花树算法）]]