refactor: deduplicate PlanarGraphAnalyzer.countComponents → delegate to GraphUtils

PlanarGraphAnalyzer had a full 20-line BFS implementation of countComponents()
that was functionally identical to GraphUtils.countComponents(). Replaced with
a one-line delegation to the shared utility, eliminating duplicated graph
traversal code.

This follows the pattern already established by TreeAnalyzer,
FeedbackVertexSetAnalyzer, and GraphSparsificationAnalyzer which all delegate
to GraphUtils for component counting.

Author: sauravbhattacharya001

Gvisual/src/gvisual/PlanarGraphAnalyzer.java

@@ -467,30 +467,9 @@ private static boolean isTriangleFree(Map<String, Set<String>> adj) {
         return true;
     }
 
-    /** Count connected components via BFS. */
+    /** Count connected components — delegates to shared GraphUtils implementation. */
     static int countComponents(Graph<String, Edge> graph) {
-        Set<String> visited = new HashSet<String>();
-        int count = 0;
-        for (String v : graph.getVertices()) {
-            if (visited.contains(v)) continue;
-            count++;
-            Queue<String> q = new ArrayDeque<String>();
-            q.add(v);
-            visited.add(v);
-            while (!q.isEmpty()) {
-                String curr = q.poll();
-                Collection<String> nbrs = graph.getNeighbors(curr);
-                if (nbrs != null) {
-                    for (String n : nbrs) {
-                        if (!visited.contains(n)) {
-                            visited.add(n);
-                            q.add(n);
-                        }
-                    }
-                }
-            }
-        }
-        return count;
+        return GraphUtils.countComponents(graph);
     }
 
     /**