New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

树的直径 | big-news' Blog #89

Open

ce-amtic opened this issue Apr 12, 2019 · 0 comments

Labels

Gitalk /2019/04/11/树的直径/

Owner

ce-amtic commented Apr 12, 2019

https://big-news.github.io/2019/04/11/%E6%A0%91%E7%9A%84%E7%9B%B4%E5%BE%84/#site-comment

边数恰好比点数少一的无向联通图被称为树（无根树）。在无根树上选出两个节点$v,u$，使得$v\to u$的路径上经过的边数最多，那么这条路径被称为树的直径……

ce-amtic added Gitalk /2019/04/11/树的直径/ labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment