Figure 1 Part II 6. Use Dijkstra algorithm step to step to find a shortest path from S to T in the following graph. (10%)

8. A problem called "Edit Distance" is defined as: Given two strings str1 and str2; edit operations: Insertion, Deletion and Substitution. We can use dynamic programming to find minimum number of operations required to convert str1 to str2. The definitions of operations are as follows: Insertion: insert a new character Deletion: delete a character Substitution: replace on character by another Please write the recursive formula. (5%)

Figure 1

Part II

6. Use Dijkstra algorithm step to step to find a shortest path from S to T in the following graph. (10%)

相關申論題

相關試卷