Figure 3
From: PARPST: a PARallel algorithm to find peptide sequence tags
Algorithm of the Propagation procedure. Propagation procedure permits, for each node, to compute the maximum length path passing through it. Pseudo-code is presented for the computation of start_path and d s for any group, while d e and end_path can be obtained by replacing pred and start_path with succ and end_path, respectively.