if multiple groups are found of the same large size, prioritize the last one to avoid recursion issues

Author: johanneswilm

diffDOM.js

@@ -373,7 +373,7 @@
             c2.forEach(function(c2Element, c2Index) {
                 if (!marked1[c1Index] && !marked2[c2Index] && roughlyEqual(c1Element, c2Element, uniqueDescriptors, subsetsSame)) {
                     matches[c1Index + 1][c2Index + 1] = (matches[c1Index][c2Index] ? matches[c1Index][c2Index] + 1 : 1);
-                    if (matches[c1Index + 1][c2Index + 1] > lcsSize) {
+                    if (matches[c1Index + 1][c2Index + 1] >= lcsSize) {
                         lcsSize = matches[c1Index + 1][c2Index + 1];
                         index = [c1Index + 1, c2Index + 1];
                     }

tests/basic.html

@@ -23,11 +23,11 @@
   <h1>Test for diffDOM</h1>
 
   <!-- Add all divs to be compared here two by two -->
-  <!--div><img><p></p><i></i><img></div>
+  <div><img><p></p><i></i><img></div>
   <div><img><p>a</p><i></i><img><p></p></div>
 
   <div><p></p><i></i><img></div>
-  <div><img><p>a</p><i></i><img><p></p></div-->
+  <div><img><p>a</p><i></i><img><p></p></div>
 
   <div><img><img><p></p><i></i><canvas></div>
   <div><p></p><img><img><canvas></div>