This is a reference.
http://www.xmailserver.org/diff2.pdf

Thank you 🙏

It just occurred to me that we have an article on finding the longest common subsequence already: https://github.com/raywenderlich/swift-algorithm-club/tree/master/Longest%20Common%20Subsequence

Could you check it out to see if it makes sense to add your ideas to the current topic?

I have known that there is an article for finding the LCS. (https://github.com/raywenderlich/swift-algorithm-club/tree/master/Longest%20Common%20Subsequence)

My topic, or MDA is faster than this algorithm. It runs for loop twice like below.

for i in self.characters {
 for j in other.characters {
 }
}

I takes O(N * M) times for the worst case 😱

One more, the LCS algorithm can get only LCS.
But, if someone understand my topic MDA and Edit Graph, it can be extended to getting Diff command, like insert or delete, not only LCS.

This may make it easy that , for example, difference refreshing for UITableView or UICollectionView.

@kelvinlauKL
I mentioned about the difference between my article and LongestCommonSubsequence.
The major difference is calculation efficiency.

and I added some explanation about figure.
Thank you 🙏

Please 🙏

Anything else is required?