摘要：
目标: 找出相互兼容的工作的最大子集 “贪婪模式“。逐个考虑工作。接受这一项工作，只要它与已经接受的工作相容。 [最早开始时间] 按sj的升序考虑工作。 [最早完成时间] 按fj的升序考虑工作。 [最短区间] 按fj - sj的升序考虑。 [冲突最少] 对于每个工作j，计算有冲突的工作cj的数量。按 阅读全文
摘要：
1. Often there are multiple shortest paths between two nodes of a graph. Give a linear-time algorithm for the following task. Input: A undirected grap 阅读全文
摘要：
Directed Acyclic Graphs Def. An Directed Acyclic Graphs is a directed graph that contains no directed cycles. （有向无环图是一种不包含有向环的有向图。）Ex. Precedence cons 阅读全文