图论——树的直径
pxlsdz
冲就完了!
展开
-
LightOj1094 Farthest Nodes in a Tree(树的直径:BFS模板)
Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. That means you have to find two nodes in the tree w...原创 2019-01-15 21:40:57 · 188 阅读 · 0 评论 -
树的直径
【定义】 这棵树中距离最远的两个结点之间相隔的距离。注意:是任意两个结点的最远距离,不是树的深度,显然,树的直径可以有很多条。 【两次dfs或者(两次bfs)】 思想:先从任意一点P出发,找离它最远的点Q,再从点Q出发,找离它最远的点W,W到Q的距离就是是的直径 证明如下(来自:https://blog.csdn.net/forever_dreams/article/detai...原创 2019-05-07 23:50:42 · 337 阅读 · 0 评论