526
个编辑
更改
跳到导航
跳到搜索
第133行：
第133行： − 图中两个顶点之间的距离是它们之间最短路径的长度（如果存在），否则该距离是无穷大。+
→Examples 例子
* The [[Distance (graph theory)|distance]] between two vertices in a graph is the length of a shortest path between them, if one exists, and otherwise the distance is infinity.
* The [[Distance (graph theory)|distance]] between two vertices in a graph is the length of a shortest path between them, if one exists, and otherwise the distance is infinity.
图中两个顶点之间，如果最短路径存在，那么它们的的距离是最短路径的长度，否则该距离是无穷大。
* The diameter of a connected graph is the largest distance (defined above) between pairs of vertices of the graph.
* The diameter of a connected graph is the largest distance (defined above) between pairs of vertices of the graph.