[理工] [資結]-圖
A relation "<=" is a partial order on a set S if 滿足下列三點:
1.reflexivy
2.Antisymmetry
3.Transitivety
The Question is:
Given a set of data with the "partial order" property, what would be
the data structure to store these data and retrieve the partial order
relation order relations later
(A) Doubly-linked list
(B) Directed acyclic graph
(C) Binary Tree
(D) Hash
(E) Tree
答案是 : B
想請問為何答案是B，以及其他不行的原因，謝謝
--
┌這篇文章讓您覺得？─────────────────────────────┐
│ │
│ 一"一 \ / >\\\< ╯ ╰ ∩ ∩ ▁ ▁ ＞＿＜ ㄧ ㄧ+ │
│ 皿 ε □ ▽ ▇Δ ▇ ╰╯ ╯ │
│ 北七 亂喔 害羞 莎笅 爽啦 哭爸 ＸＤ 科科 │
└──────────────────────────────────────┘
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.116.14.2
→
10/24 03:02, , 1F
10/24 03:02, 1F