[理工] [離散]-Tree
1. A graph in which there has at most one path between every pair of
vertices is a tree
答案為FALSE 但我覺得好奇怪 {連通 沒cycle e=v-1} 任兩成立 就是tree
以上我覺得任兩點有path 則為連通 路徑惟一 表示沒cycle
則應該是tree阿 還是我想錯了?
2. An acyclic graph with 8 vertices has 7 edges
沒環路且e=v-1的圖 條件明顯成立
但答案為false 更奇怪了...
懇求高手指導
謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.127.208.96
推
09/27 15:10, , 1F
09/27 15:10, 1F
→
09/27 16:22, , 2F
09/27 16:22, 2F
→
09/27 16:38, , 3F
09/27 16:38, 3F
→
09/27 17:08, , 4F
09/27 17:08, 4F
→
09/27 19:17, , 5F
09/27 19:17, 5F
→
09/27 19:17, , 6F
09/27 19:17, 6F
→
09/27 23:19, , 7F
09/27 23:19, 7F
討論串 (同標題文章)