演算法›Ch4 圖論演算法
第 107 題/共 111 題
◀ AL 107/111
107. AOE Network、Critical Path
#AL-04-107中AOE NetworkCritical Path

The adjacency list below is for an AOE network. The end field points to a list of adjacent vertices, dur field is the duration of the activity, link field points to another adjacent vertex, vertex field is the id of the adjacent vertex, count field is the number of immediate predecessors. Which of the following statements are true?

題目附圖
📄 中央111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 101–111 / 111