MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / editDistDP

Function editDistDP

dynamic_programming/minimum_edit_distance.cpp:92–134  ·  view source on GitHub ↗

* @brief Calculates and stores the result * of all the sub-problems, so that we don't have to recur to compute * the minimum cost of a particular operation if it is already * computed and stored in the `dp` vector. * @param dp vector to store the computed minimum costs * @param str1 to pass the 1st string * @param str2 to pass the 2nd string * @param m the length of str1 * @param n

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

testFunction · 0.70

Calls 1

minFunction · 0.70

Tested by

no test coverage detected