* @brief Builds the LCS according to B using a traceback approach * @param s1 first null-terminated string * @param l1 length of s1 * @param l2 length of s2 * @param L matrix of size l1 x l2 * @param B matrix of size l1 x l2 * @returns lcs longest common subsequence */
source not stored for this graph (policy: none)