《数据结构的算法在C++中的应用》（英文版）Chapter 12 Graphs

12.1 Definition and terminologies ograph Graph G=(VE)G=(V,E), ifVCV,ECE and the vertices incident on the edges in e are in V, then g is the subgraph of g For example

12.1 Definition and terminologies 4. Subgraph Graph G=(V,E),G’=(V’,E’), if V’V, E’E, and the vertices incident on the edges in E’ are in V’, then G’ is the subgraph of G. For example: 1 3 4 2 1 1 3 3 1 4

12.1 Definition and terminologies Another example

12.1 Definition and terminologies • Another example: V2 V4 V3 V1 V2 V3 V1 V1