Longest path length in an undirected tree, can we prove this algorithm is correct (which it is)?
Channel: Roel Van de Paar
Date: 28/02/2021

Longest path length in an undirected tree, can we prove this algorithm is correct (which it is)?

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user nitangle (cs.stackexchange.com/users/74494), user j_random_hacker (cs.stackexchange.com/users/1984), user d_darric (cs.stackexchange.com/users/104728), and the Stack Exchange Network (cs.stackexchange.com/questions/121221). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com