Index: src/Common/NetTopologySuite/GeometriesGraph/Index/SimpleEdgeSetIntersector.cs
===================================================================
diff -u -r8f6ae890fed8e8eae3a32f9c0498a10f82e0ddf9 -r5fc71a385897af92ccb092f2f969b5709afab85a
--- src/Common/NetTopologySuite/GeometriesGraph/Index/SimpleEdgeSetIntersector.cs	(.../SimpleEdgeSetIntersector.cs)	(revision 8f6ae890fed8e8eae3a32f9c0498a10f82e0ddf9)
+++ src/Common/NetTopologySuite/GeometriesGraph/Index/SimpleEdgeSetIntersector.cs	(.../SimpleEdgeSetIntersector.cs)	(revision 5fc71a385897af92ccb092f2f969b5709afab85a)
@@ -10,11 +10,11 @@
     /// This algorithm is too slow for production use, but is useful for testing purposes.
     /// </summary>
     public class SimpleEdgeSetIntersector : EdgeSetIntersector
-    {        
+    {
         /// <summary>
         /// 
         /// </summary>
-        public SimpleEdgeSetIntersector() { }
+        public SimpleEdgeSetIntersector() {}
 
         /// <summary>
         /// 
@@ -23,15 +23,17 @@
         /// <param name="si"></param>
         /// <param name="testAllSegments"></param>
         public override void ComputeIntersections(IList edges, SegmentIntersector si, bool testAllSegments)
-        {            
-            for (IEnumerator i0 = edges.GetEnumerator(); i0.MoveNext(); ) 
+        {
+            for (IEnumerator i0 = edges.GetEnumerator(); i0.MoveNext();)
             {
                 Edge edge0 = (Edge) i0.Current;
-                for (IEnumerator i1 = edges.GetEnumerator(); i1.MoveNext(); ) 
+                for (IEnumerator i1 = edges.GetEnumerator(); i1.MoveNext();)
                 {
                     Edge edge1 = (Edge) i1.Current;
                     if (testAllSegments || edge0 != edge1)
+                    {
                         ComputeIntersects(edge0, edge1, si);
+                    }
                 }
             }
         }
@@ -43,14 +45,14 @@
         /// <param name="edges1"></param>
         /// <param name="si"></param>
         public override void ComputeIntersections(IList edges0, IList edges1, SegmentIntersector si)
-        {            
-            for (IEnumerator i0 = edges0.GetEnumerator(); i0.MoveNext(); )
+        {
+            for (IEnumerator i0 = edges0.GetEnumerator(); i0.MoveNext();)
             {
                 Edge edge0 = (Edge) i0.Current;
-                for (IEnumerator i1 = edges1.GetEnumerator(); i1.MoveNext(); )
+                for (IEnumerator i1 = edges1.GetEnumerator(); i1.MoveNext();)
                 {
                     Edge edge1 = (Edge) i1.Current;
-                        ComputeIntersects(edge0, edge1, si);
+                    ComputeIntersects(edge0, edge1, si);
                 }
             }
         }
@@ -67,9 +69,13 @@
         {
             ICoordinate[] pts0 = e0.Coordinates;
             ICoordinate[] pts1 = e1.Coordinates;
-            for (int i0 = 0; i0 < pts0.Length - 1; i0++) 
-                for (int i1 = 0; i1 < pts1.Length - 1; i1++)             
-                    si.AddIntersections(e0, i0, e1, i1);            
+            for (int i0 = 0; i0 < pts0.Length - 1; i0++)
+            {
+                for (int i1 = 0; i1 < pts1.Length - 1; i1++)
+                {
+                    si.AddIntersections(e0, i0, e1, i1);
+                }
+            }
         }
     }
-}
+}
\ No newline at end of file