Index: src/Common/NetTopologySuite/Noding/NodingValidator.cs
===================================================================
diff -u -r8f6ae890fed8e8eae3a32f9c0498a10f82e0ddf9 -r5fc71a385897af92ccb092f2f969b5709afab85a
--- src/Common/NetTopologySuite/Noding/NodingValidator.cs	(.../NodingValidator.cs)	(revision 8f6ae890fed8e8eae3a32f9c0498a10f82e0ddf9)
+++ src/Common/NetTopologySuite/Noding/NodingValidator.cs	(.../NodingValidator.cs)	(revision 5fc71a385897af92ccb092f2f969b5709afab85a)
@@ -13,7 +13,7 @@
     {
         private readonly LineIntersector li = new RobustLineIntersector();
         private readonly IList segStrings;
-        
+
         /// <summary>
         /// Initializes a new instance of the <see cref="NodingValidator"/> class.
         /// </summary>
@@ -36,21 +36,27 @@
         private void CheckCollapses()
         {
             foreach (SegmentString ss in segStrings)
-                CheckCollapses(ss);            
+            {
+                CheckCollapses(ss);
+            }
         }
 
         private void CheckCollapses(SegmentString ss)
         {
             var pts = ss.Coordinates;
             for (var i = 0; i < pts.Length - 2; i++)
-                CheckCollapse(pts[i], pts[i + 1], pts[i + 2]);            
+            {
+                CheckCollapse(pts[i], pts[i + 1], pts[i + 2]);
+            }
         }
 
         private void CheckCollapse(ICoordinate p0, ICoordinate p1, ICoordinate p2)
         {
             if (p0.Equals(p2))
+            {
                 throw new ApplicationException(String.Format(
                     "found non-noded collapse at: {0}, {1} {2}", p0, p1, p2));
+            }
         }
 
         /// <summary>
@@ -59,44 +65,60 @@
         private void CheckInteriorIntersections()
         {
             foreach (SegmentString ss0 in segStrings)
-                foreach(SegmentString ss1 in segStrings)
-                    CheckInteriorIntersections(ss0, ss1);                
+            {
+                foreach (SegmentString ss1 in segStrings)
+                {
+                    CheckInteriorIntersections(ss0, ss1);
+                }
+            }
         }
 
         private void CheckInteriorIntersections(SegmentString ss0, SegmentString ss1)
         {
             var pts0 = ss0.Coordinates;
             var pts1 = ss1.Coordinates;
             for (var i0 = 0; i0 < pts0.Length - 1; i0++)
+            {
                 for (var i1 = 0; i1 < pts1.Length - 1; i1++)
-                    CheckInteriorIntersections(ss0, i0, ss1, i1);            
+                {
+                    CheckInteriorIntersections(ss0, i0, ss1, i1);
+                }
+            }
         }
 
         private void CheckInteriorIntersections(SegmentString e0, int segIndex0, SegmentString e1, int segIndex1)
         {
-            if (e0 == e1 && segIndex0 == segIndex1) 
+            if (e0 == e1 && segIndex0 == segIndex1)
+            {
                 return;
+            }
 
             var p00 = e0.Coordinates[segIndex0];
             var p01 = e0.Coordinates[segIndex0 + 1];
             var p10 = e1.Coordinates[segIndex1];
             var p11 = e1.Coordinates[segIndex1 + 1];
 
             li.ComputeIntersection(p00, p01, p10, p11);
-            if (li.HasIntersection)  
+            if (li.HasIntersection)
+            {
                 if (li.IsProper || HasInteriorIntersection(li, p00, p01) || HasInteriorIntersection(li, p10, p11))
+                {
                     throw new ApplicationException(String.Format(
-                        "found non-noded intersection at {0}-{1} and {2}-{3}", p00, p01, p10, p11));                            
+                        "found non-noded intersection at {0}-{1} and {2}-{3}", p00, p01, p10, p11));
+                }
+            }
         }
 
         private bool HasInteriorIntersection(LineIntersector li, ICoordinate p0, ICoordinate p1)
         {
             for (var i = 0; i < li.IntersectionNum; i++)
             {
                 var intPt = li.GetIntersection(i);
-                if (!(intPt.Equals(p0) || 
+                if (!(intPt.Equals(p0) ||
                       intPt.Equals(p1)))
+                {
                     return true;
+                }
             }
             return false;
         }
@@ -121,10 +143,14 @@
             {
                 var pts = ss.Coordinates;
                 for (var j = 1; j < pts.Length - 1; j++)
+                {
                     if (pts[j].Equals(testPt))
+                    {
                         throw new ApplicationException(String.Format(
-                            "found endpt/interior pt intersection at index {0} :pt {1}", j, testPt));                
+                            "found endpt/interior pt intersection at index {0} :pt {1}", j, testPt));
+                    }
+                }
             }
         }
     }
-}
+}
\ No newline at end of file