If any fork in the tree can be linked to a historical event, all the other branch points can be dated.
如果这颗树上的任何一支可以与一个历史事件联系起来，那么就能推断所有其他分支点的时间。
After the previous test, Process a and Process Z diverge, each taking a separate code path, as if both came to a fork in the road and each took a distinct branch.
在上次测试之后，进程a和进程z会出现差异，每个进程会采用单独的代码路径，就像路上出现岔道，每一个都会走上不同的分枝。
Switch to the output branches TAB of the Fork attribute, as Figure 42 shows, to see the output branch of the Fork.
切换到Fork属性的Outputbranches选项卡(如图42所示)，查看Fork的输出分支。
Decision and merge are always mapped to several input and output criteria-one for each branch, while fork and join correspond to a single output and input criterion, respectively.
Decision和merge始终映射到多个输入和输出条件，每个分支对应一个条件，而fork和join则分别对应于一个输出和输入条件。
This means, for each branch of the fork, the merge executes and triggers the activities further downstream in the process model.
这意味着，对于fork的每个分支，merge都将执行并触发流程模型中的下游活动。
When this backward branch enters the merge, the merge executes and triggers the fork again, which in turn activates its two outgoing branches.
当此逆向分支进入merge时，将执行merge并再次触发fork，后者又会激活它的两个传出分支。
The other branch causes a cycle between the fork and the merge.
另一个分支将导致fork和merge之间的循环。
The upper branch leads to a fork that causes Task 1 and Task 2 to execute in parallel.
上面的分支通向一个fork，后者可以使Task1和Task2并列执行。
The upper branch of the inclusive decision connects to a third cyclic process fragment with a merge preceding a fork.
inclusive decision 最上方的分支使用fork 之前的merge连接到第三个循环流程片断。
A could bypass the fork and join, but it still needs to enter and leave the process fragment in the upper branch of the fork.
A可以绕过fork和join，但它仍然需要进入和离开 fork 的靠上那条分支中的流程片断。
Switch to the input branches TAB of the fork attribute, as Figure 41 shows, to see the input branch of the fork.
切换到Fork属性的Inputbranches选项卡(如图41所示)，查看Fork的输入分支。
The steps branch out using a fork, and come back together using a join.
步骤使用分叉分出，并使用联合返回。
The upper Yes branch leads to a fork, which captures a parallel branching in the process flow.
上面的Yes分支引向 fork，后者将在流程流中捕获一个并行分支。
Each outgoing branch of the fork with all its connections ends as an incoming branch of the merge.
fork的每个传出分支都将其连接末端用作merge的传入分支。
So it turns out in c, you can absolutely represent the idea of a condition, a branch, a fork in the road.
结果在C语言中，你们完全可以表示出环境的概念，一个分支，一个三岔路口。
Step 5, now this is an example of what we'll henceforth call a condition or a branch because it's sort of a fork in the road.
步骤五，这是一个关于我们调用一个条件，或者分支语句的例子，因为这是一个岔路口。
Step 5, now this is an example of what we'll henceforth call a condition or a branch because it's sort of a fork in the road.
步骤五，这是一个关于我们调用一个条件，或者分支语句的例子，因为这是一个岔路口。
应用推荐