[理工] 離散-Tree

看板Grad-ProbAsk作者 (thankakimo)時間17年前 (2009/03/19 16:34), 編輯推噓1(1推 0噓 2→)
留言3則, 2人參與, 最新討論串1/1
題目:If a forest F consist of m trees and has n vertices,how many edges does F have? 問題: 請問這題要怎麼下手呢??? 煩請各位大大幫忙解答 感謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 163.14.68.41
→
03/19 16:37, , 1F
e=n-m
03/19 16:37, 1F
推
03/19 17:38, , 2F
回去看tree的定義...單顆樹 e = v-1
03/19 17:38, 2F
→
03/19 17:38, , 3F
forest 就全部加總就好了
03/19 17:38, 3F
‣ 更多 thank1984 的文章
文章代碼(AID): #19mWEAXK (Grad-ProbAsk)