Index: src/Common/NetTopologySuite/Planargraph/Algorithm/ConnectedSubgraphFinder.cs
===================================================================
diff -u -r8f6ae890fed8e8eae3a32f9c0498a10f82e0ddf9 -r5fc71a385897af92ccb092f2f969b5709afab85a
--- src/Common/NetTopologySuite/Planargraph/Algorithm/ConnectedSubgraphFinder.cs	(.../ConnectedSubgraphFinder.cs)	(revision 8f6ae890fed8e8eae3a32f9c0498a10f82e0ddf9)
+++ src/Common/NetTopologySuite/Planargraph/Algorithm/ConnectedSubgraphFinder.cs	(.../ConnectedSubgraphFinder.cs)	(revision 5fc71a385897af92ccb092f2f969b5709afab85a)
@@ -7,7 +7,7 @@
     /// </summary>
     public class ConnectedSubgraphFinder
     {
-        private PlanarGraph graph;
+        private readonly PlanarGraph graph;
 
         /// <summary>
         /// Initializes a new instance of the <see cref="ConnectedSubgraphFinder"/> class.
@@ -28,12 +28,14 @@
 
             GraphComponent.SetVisited(graph.GetNodeEnumerator(), false);
             IEnumerator ienum = graph.GetEdgeEnumerator();
-            while(ienum.MoveNext())
+            while (ienum.MoveNext())
             {
                 Edge e = ienum.Current as Edge;
                 Node node = e.GetDirEdge(0).FromNode;
                 if (!node.IsVisited)
-                    subgraphs.Add(FindSubgraph(node));                
+                {
+                    subgraphs.Add(FindSubgraph(node));
+                }
             }
             return subgraphs;
         }
@@ -57,7 +59,7 @@
             nodeStack.Push(startNode);
             while (!(nodeStack.Count == 0))
             {
-                Node node = (Node)nodeStack.Pop();
+                Node node = (Node) nodeStack.Pop();
                 AddEdges(node, nodeStack, subgraph);
             }
         }
@@ -71,15 +73,17 @@
         private void AddEdges(Node node, Stack nodeStack, Subgraph subgraph)
         {
             node.Visited = true;
-            IEnumerator i = ((DirectedEdgeStar)node.OutEdges).GetEnumerator();
-            while(i.MoveNext())
+            IEnumerator i = ((DirectedEdgeStar) node.OutEdges).GetEnumerator();
+            while (i.MoveNext())
             {
-                DirectedEdge de = (DirectedEdge)i.Current;
+                DirectedEdge de = (DirectedEdge) i.Current;
                 subgraph.Add(de.Edge);
                 Node toNode = de.ToNode;
-                if (!toNode.IsVisited) 
+                if (!toNode.IsVisited)
+                {
                     nodeStack.Push(toNode);
+                }
             }
         }
     }
-}
+}
\ No newline at end of file