📚 IGCSE Edexcel Maths: Critical Path Analysis Exam Focus | IGCSE Edexcel 数学：关键路径分析 考点精讲
Critical Path Analysis (CPA) is a fundamental project management tool tested in the Edexcel IGCSE Mathematics syllabus. It helps determine the minimum time needed to complete a project and identifies tasks that cannot be delayed without affecting the overall finish. Mastering CPA requires fluency in activity networks, forward and backward passes, float calculations, and interpreting the critical path. This article breaks down every key concept, provides worked examples, and shares examiner tips to help you achieve top marks.
关键路径分析（CPA）是 Edexcel IGCSE 数学大纲中考察的基础项目管理工具。它能确定完成项目所需的最短时间，并识别出那些一旦延误会直接影响整体工期的任务。掌握 CPA 需要熟练运用活动网络、前向与后向遍历、浮动时间计算以及解读关键路径。本文拆解每一个核心知识点，给出解题范例，并分享考官级技巧，助你冲击高分。
1. What is Critical Path Analysis? | 什么是关键路径分析？
Critical Path Analysis models a project as a set of activities with given durations and dependencies. The goal is to find the longest path through the network from start to finish – the critical path – because it dictates the minimum project duration. Any delay on a critical activity delays the whole project, while non-critical activities have some ‘float’ or slack time. IGCSE questions typically ask you to draw an activity network, complete event boxes, calculate floats, and state the critical path.
关键路径分析将项目建模为一组具有给定持续时间和相互依赖关系的活动。目标是寻找从开始到结束贯穿网络的最长路径——即关键路径，因为它决定了项目的最短工期。任何关键活动的延误都会拖累整个项目，而非关键活动则拥有一定“浮动时间”。IGCSE 试题通常要求考生画出活动网络、完成事件框、计算浮动时间并给出关键路径。
2. Activity Networks and Precedence Tables | 活动网络与前驱关系表
An activity-on-arc network uses directed edges to represent activities and nodes to represent events (start or finish of activities). A precedence table lists each activity, its duration, and its immediate predecessors. For example, activity C may depend on A and B both being complete. Always interpret ‘depends on’ carefully: if A precedes B, A must finish before B can start.
在弧表示活动网络中，有向边代表活动，节点代表事件（活动的开始或结束）。前驱关系表列出每个活动的持续时间及其直接前驱。例如，活动 C 可能依赖于 A 和 B 均已完工。解读“依赖于”时务必仔细：若 A 是 B 的前驱，则 A 结束后 B 才能开始。
3. Constructing an Activity-on-Arc Network | 构建弧表示活动网络
Start with a single source node labelled 0. Each activity is drawn as an arrow from one node to another. Activities emerging from a node can only begin when all activities entering that node are complete. Label each arrow with the activity letter and its duration, e.g. A(3). Keep the network tidy and avoid unnecessary crossings. Edexcel often provides a precedence table and requires you to draw the network in the answer booklet.
从标记为 0 的源节点开始。每个活动用从一个节点指向另一个节点的箭头表示。从某节点发出的所有活动，必须在该节点的所有入边活动完成后才能开始。在箭头上标记活动字母及其持续时间，如 A(3)。保持网络整齐，避免不必要的交叉。Edexcel 常给出前驱表面并要求你在答题册中画出网络。
4. Dummy Activities and Their Purpose | 虚活动及其用途
Dummy activities are represented by dashed arrows and have zero duration. They are used purely to maintain logical dependencies without implying extra work. Typical scenarios include: two activities sharing the same start and end nodes (to avoid parallel edges), or when one activity depends on a predecessor but another does not. A dummy ensures correct precedence without affecting total time.
虚活动用虚线箭头表示，持续时间为零。它们仅用于维持逻辑依赖关系，而不代表额外工作。典型情形包括：两个活动共享相同的起止节点（为避免平行边），或者当一个活动依赖于某前驱而另一个不依赖时。虚活动保证了正确的前驱关系，且不影响总时间。
5. Earliest Start Times (EST) – Forward Pass | 最早开始时间（EST）——前向遍历
Perform a forward pass to compute the earliest time each event can be reached. Set EST of the start node to 0. For each subsequent node, its EST is the maximum of (EST of predecessor node + duration of incoming activity). Write this number in the left half of the event box. If multiple activities lead into a node, take the largest sum. This gives the earliest possible project completion at the final node.
进行前向遍历以计算每个事件的最早到达时间。将起始节点的 EST 设为 0。对每个后续节点，其 EST 等于（前驱节点的 EST + 引入活动的持续时间）的最大值。将该数字填入事件框的左半部分。若有多条活动指向同一节点，取最大和值。最终节点的 EST 即为项目最早可能完工时间。
6. Latest Start Times (LST) – Backward Pass | 最晚开始时间（LST）——后向遍历
After determining the project duration from the forward pass, perform a backward pass. The LST of the final node equals its EST (project duration). For each preceding node, LST = minimum of (LST of successor node – duration of outgoing activity). Write this number in the right half of the event box. If multiple activities leave a node, take the smallest difference. This ensures no overall delay beyond the project deadline.
通过前向遍历确定项目工期后，进行后向遍历。最终节点的 LST 等于其 EST（项目工期）。对每个前驱节点，LST =（后继节点的 LST – 离开活动的持续时间）的最小值。将该数字填入事件框的右半部分。若多条活动离开同一节点，取最小的差值。这确保整体项目不会超过截止日期。
7. Float and Total Float Calculation | 浮动时间与总浮动时间计算
Total float of an activity is the maximum time it can be delayed without affecting the project end date. It is calculated as: Total Float = LST at end node – EST at start node – duration. Alternatively, you can use event times from the node boxes: for an activity from node i to j, float = LSTⱼ – ESTᵢ – duration. Activities with zero total float are critical. A smaller value means less slack. Always show the formula and substitution in exams.
活动的总浮动时间是指在不影响项目完工日期的前提下，该活动可以被延迟的最大时间。计算公式为：总浮动时间 = 终点节点的 LST – 起点节点的 EST – 持续时间。也可利用节点框中的事件时间：对于从节点 i 到 j 的活动，浮动时间 = LSTⱼ – ESTᵢ – 持续时间。总浮动时间为零的活动即为关键活动。数值越小，弹性越小。考试中务必写出公式并代入数值。
8. Identifying the Critical Path | 识别关键路径
The critical path consists of activities with zero total float. Trace through the network from start to finish, choosing only those edges where the difference between node times equals the activity duration (i.e. ESTⱼ – ESTᵢ = duration and LSTⱼ – LSTᵢ = duration). Usually more than one path must be checked. You will be asked to list activities in order, e.g. A – C – F – H. If there are two equally long critical paths, state both.
关键路径由总浮动时间为零的活动组成。从起点到终点遍历网络，只选择那些节点时间差等于活动持续时间的边（即 ESTⱼ – ESTᵢ = 持续时间，且 LSTⱼ – LSTᵢ = 持续时间）。通常需要检查多条路径。题目会要求按顺序列出活动，如 A – C – F – H。若存在两条等长的关键路径，需同时给出。
9. Interpreting the Critical Path and Float | 解读关键路径与浮动时间
The critical path tells the project manager which tasks cannot slip. The shortest project time is the EST at the sink node. Float values indicate how much flexibility exists in non-critical activities. If a delay in a non-critical activity exceeds its total float, the project finish date will be delayed. Also, if a resource is shifted from a critical activity to another, the project duration increases. These interpretation questions test understanding beyond mere calculation.
关键路径告诉项目经理哪些任务不可松懈。最短项目时间即为汇节点的 EST。浮动时间数值表明非关键活动有多大的灵活度。若某非关键活动的延误超过其总浮动时间，项目完工日期将会推迟。此外，若将资源从关键活动转移到其他活动，项目工期会延长。这类解读題考查的是超越单纯计算的理解力。
10. Common Mistakes and Exam Tips | 常见错误与考试技巧
Many students lose marks by misreading the precedence table, especially when ‘depends on A and B’ means both must finish. Another pitfall is forgetting dummy activities when needed. Always double-check the forward pass: EST = max(incoming). For backward pass: LST = min(outgoing). Ensure event boxes on nodes are fully filled: left EST, right LST. When calculating float, use the correct start and end nodes – not the activity’s own EST and LST on the arrow. In an exam, show each step explicitly: forward pass, backward pass, then float table or calculations, and finally state the critical path and project duration clearly.
许多学生因误读前驱表面而失分，特别是将“依赖于 A 和 B”理解为两者都必须完工。另一个易错点是忘记在必要时加入虚活动。务必反复检查前向遍历：EST = 入边最大值。后向遍历：LST = 出边最小值。确保节点上的事件框完整填写：左边 EST，右边 LST。计算浮动时间时，要使用正确的起止节点，而非箭头标注的活动自身 EST、LST。考试中，逐步明确展示：前向遍历、后向遍历，随后列出浮动时间表或计算式，最后清晰地写出关键路径和项目工期。
11. Worked Example – From Precedence Table to Critical Path | 范例——从前驱表面到关键路径
Let’s apply the concepts to a typical IGCSE task.
将概念应用于一道典型的 IGCSE 题目。
Precedence table | 前驱表面:
| Activity | 活动 | Duration (days) | 工期 | Predecessors | 前驱 |
|---|---|---|
| A | 4 | – |
| B | 5 | – |
| C | 3 | A |
| D | 6 | A |
| E | 2 | B, C |
| F | 4 | D, E |
We draw the activity network with nodes 1 to 5. Dummy is not needed here. Forward pass: EST₁ = 0. EST₂ = 4 (A). EST₃ = max(0+5=5 via B, 4+3=7 via A-C) = 7. EST₄ = max(4+6=10 via D, 7+2=9 via E) = 10. EST₅ = 10+4 = 14. Project duration = 14 days. Backward pass: LST₅ = 14. LST₄ = 14−4 = 10. LST₃ = 10−2 = 8. LST₂ = min(8−3=5, 10−6=4 via D? Wait, D from 2 to 4 => LST₄ − duration D = 10−6=4) so LST₂ = min(5, 4) = 4. LST₁ = min(LST₂−4=0, LST₃−5=3) = 0. Critical path: A – D – F (total float = 0 for each). C, B, E have floats.
画出节点 1 到 5 的活动网络，此处无需虚活动。前向遍历：EST₁ = 0。EST₂ = 4（A）。EST₃ = max(0+5=5 via B, 4+3=7 via A-C)=7。EST₄ = max(4+6=10 via D, 7+2=9 via E)=10。EST₅ = 10+4=14。项目工期为 14 天。后向遍历：LST₅=14。LST₄=14−4=10。LST₃=10−2=8。LST₂=min(8−3=5, 10−6=4)=4。LST₁=min(LST₂−4=0, LST₃−5=3)=0。关键路径：A – D – F（每项总浮动时间为 0）。C、B、E 有浮动时间。
12. Summary and Final Revision Checklist | 总结与考前检查清单
To excel in Critical Path Analysis, ensure you can: convert a precedence table to a correct activity network, use dummies appropriately, carry out forward and backward passes accurately, compute total float, identify the critical path as the chain of zero-float activities, and interpret the significance of float in project management. Practice with past Edexcel IGCSE papers, paying special attention to networks with multiple dependencies. Always label node boxes clearly and show all working.
要在关键路径分析中脱颖而出，请确保你能：将前驱表面转换为正确的活动网络，恰当地使用虚活动，准确执行前向和后向遍历，计算总浮动时间，识别由零浮动时间活动构成的关键路径，并解读浮动时间在项目管理中的意义。使用 Edexcel IGCSE 历年真题进行练习，特别留意具有多重依赖关系的网络。始终保持节点框标注清晰，并展示所有解题步骤。
Published by TutorHao | Maths Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导