526
个编辑
更改
跳到导航
跳到搜索
第135行：
第135行： − 图的顶点按照它们与给定顶点之间的距离划分成子集的过程称为'''<font color="#ff8000">图的层次结构 Level Structure of The Graph</font>'''。+ 第143行：
第143行： − 对于每一对顶点，有一条唯一的最短路径连接它们，这样的图称为'''<font color="#ff8000">测地图 Geodetic Graph</font>'''。例如，所有的树都是测地图。+ − −
→Related concepts 相关概念
The partition of a graph's vertices into subsets by their distances from a given starting vertex is called the level structure of the graph.
The partition of a graph's vertices into subsets by their distances from a given starting vertex is called the level structure of the graph.
图的顶点依据与它们与给定顶点之间的距离划分成子集的过程称为'''<font color="#ff8000">图的层次结构 Level Structure of The Graph</font>'''。
A graph such that for every pair of vertices there is a unique shortest path connecting them is called a geodetic graph. For example, all trees are geodetic.
A graph such that for every pair of vertices there is a unique shortest path connecting them is called a geodetic graph. For example, all trees are geodetic.
如果对于每一对顶点，有一条唯一的最短路径连接它们，那么这样的图称为'''<font color="#ff8000">测地图 Geodetic Graph</font>'''。例如，所有的树状图都是测地图。
==Algorithm for finding pseudo-peripheral vertices 寻找伪周边的算法==
==Algorithm for finding pseudo-peripheral vertices 寻找伪周边的算法==