作者polomoss (小泽)
看板Grad-ProbAsk
标题[理工] [资结]-图
时间Fri Oct 23 22:57:12 2009
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
1F：→ ssccg:因为表关系就是用direct graph，而acyclic保证antisymmetry 10/24 03:02