Suggestions(1)
Exact(18)
Finding an augment path.
Updating link capacity on augment path.
Merging the augment path to the output topology.
4) Updating link capacity on augment path After calculating the augment path, the unit capacity of directed link is updated.
In Algorithm 1, the procedure in FICTC has five phases, namely, setting the fault-tolerant requirement k ij,, splitting operation, finding an augment path, updating link capacity on augment path, and merging the augment path into the output topology.
Fig. 4 Example of calculating the augment paths 3) Finding an augment path Finding the augment path is a key step in obtaining k ij node-disjoint paths.
Similar(42)
Fig. 6 Example of merging the augment paths.
Fig. 4 Example of calculating the augment paths.
After finding the augment paths, these paths are used to update the flow.
Fig. 6 Example of merging the augment paths Main procedure is summarized in Algorithm 1. .
In the final phase, these links that included in all augment paths are merged into the constructed topology.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com