[理工][DS] 台大電機98 第12題
Any undirected graph with n nodes and n-1 edges,
where n>=1, is a tree
找到的答案是說false
但想半天想不出來是圖長怎樣會出錯
Note:
Graphs
A graph does not contain self-circular edges,
e.g.,(u,u),nor multiple edges between two nodes,
i.e., at most one entry (u,v) in E for each distinct u and v
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.112.106.241
→
01/31 22:07, , 1F
01/31 22:07, 1F
→
01/31 22:08, , 2F
01/31 22:08, 2F
推
02/01 00:54, , 3F
02/01 00:54, 3F
推
02/01 01:01, , 4F
02/01 01:01, 4F
→
02/01 01:02, , 5F
02/01 01:02, 5F
→
02/01 01:03, , 6F
02/01 01:03, 6F
→
02/01 01:03, , 7F
02/01 01:03, 7F
→
02/01 01:03, , 8F
02/01 01:03, 8F
→
02/01 01:04, , 9F
02/01 01:04, 9F
→
02/01 01:27, , 10F
02/01 01:27, 10F
→
09/11 14:50, , 11F
09/11 14:50, 11F