# 图距离 Distance (graph theory)

（重定向自图距离

## 相关概念

--Ricky 是我功力太渣吗，我读不懂这句话啊......


## 寻找伪边缘点的算法 Algorithm for finding pseudo-peripheral vertices

1. 选择顶点 $\displaystyle{ u }$
2. 在所有尽可能远离$\displaystyle{ u }$的顶点中，让$\displaystyle{ v }$是一个最小度的顶点。
3. 如果$\displaystyle{ \epsilon(v) \gt \epsilon(u) }$，那么令 $\displaystyle{ u=v }$ 并重复步骤2，否则 $\displaystyle{ u }$是一个伪边缘点。

## 参考文献

1. Bouttier, Jérémie; Di Francesco,P.; Guitter, E. (July 2003). "Geodesic distance in planar graphs". Nuclear Physics B. 663 (3): 535–567. arXiv:cond-mat/0303272. doi:10.1016/S0550-3213(03)00355-9. By distance we mean here geodesic distance along the graph, namely the length of any shortest path between say two given faces
2. Weisstein, Eric W. "Graph Geodesic". MathWorld--A Wolfram Web Resource. Wolfram Research. Retrieved 2008-04-23. The length of the graph geodesic between these points d(u,v) is called the graph distance between u and v
3. F. Harary, Graph Theory, Addison-Wesley, 1969, p.199.
4. Øystein Ore, Theory of graphs [3rd ed., 1967], Colloquium Publications, American Mathematical Society,p.104