1、In graph theory, a subgraph is a graph that is obtained from another graph by deleting some edges and/or vertices.
在图论中，子图是通过删除一些边和/或顶点从另一个图获得的图形。
2、To find a subgraph in a larger graph, one may use various algorithms such as depth-first search or breadth-first search.
为了在较大的图中找到子图，可以使用各种算法，如深度优先搜索或广度优先搜索。