[理工] [資結]BFS

[bouwhat (微笑的故事)]

請問
為什麼做兩次BFS可以找到
"Diameter"
the longest path of shortest path?

--
posted from android bbs reader on my samsung GT-I9003

https://market.android.com/details?id=com.bbs.reader

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 27.245.158.63