Remove dead fields and duplicate BFS in report generators

- NetworkReportGenerator: remove 5 unused private edge-type fields
  (friendEdges, fsEdges, classmateEdges, strangerEdges, studyGEdges)
  that were assigned in the constructor but never read — generate()
  already uses the edgesByType map directly.
- NetworkReportGenerator: replace duplicate countComponents() BFS with
  existing GraphUtils.findComponents(graph).size(), eliminating ~20
  lines of duplicated traversal logic.
- GraphSummarizer: remove 5 unused private edge-type fields that were
  only needed to construct GraphStats — use local variables instead.

Author: sauravbhattacharya001

Gvisual/src/gvisual/GraphSummarizer.java

@@ -28,11 +28,6 @@ public class GraphSummarizer {
     private final Graph<String, Edge> graph;
     private final GraphStats stats;
     private final CommunityDetector communities;
-    private final List<Edge> friendEdges;
-    private final List<Edge> fsEdges;
-    private final List<Edge> classmateEdges;
-    private final List<Edge> strangerEdges;
-    private final List<Edge> studyGEdges;
 
     /**
      * Creates a new GraphSummarizer.
@@ -55,13 +50,12 @@ public GraphSummarizer(Graph<String, Edge> graph,
             throw new IllegalArgumentException("Graph must not be null");
         }
         this.graph = graph;
-        this.friendEdges = friendEdges != null ? friendEdges : new ArrayList<Edge>();
-        this.fsEdges = fsEdges != null ? fsEdges : new ArrayList<Edge>();
-        this.classmateEdges = classmateEdges != null ? classmateEdges : new ArrayList<Edge>();
-        this.strangerEdges = strangerEdges != null ? strangerEdges : new ArrayList<Edge>();
-        this.studyGEdges = studyGEdges != null ? studyGEdges : new ArrayList<Edge>();
-        this.stats = new GraphStats(graph, this.friendEdges, this.fsEdges,
-                this.classmateEdges, this.strangerEdges, this.studyGEdges);
+        List<Edge> fe = friendEdges != null ? friendEdges : new ArrayList<Edge>();
+        List<Edge> fse = fsEdges != null ? fsEdges : new ArrayList<Edge>();
+        List<Edge> ce = classmateEdges != null ? classmateEdges : new ArrayList<Edge>();
+        List<Edge> se = strangerEdges != null ? strangerEdges : new ArrayList<Edge>();
+        List<Edge> sge = studyGEdges != null ? studyGEdges : new ArrayList<Edge>();
+        this.stats = new GraphStats(graph, fe, fse, ce, se, sge);
         this.communities = new CommunityDetector(graph);
     }
 

Gvisual/src/gvisual/NetworkReportGenerator.java

@@ -34,11 +34,6 @@
 public class NetworkReportGenerator {
 
     private final Graph<String, Edge> graph;
-    private final List<Edge> friendEdges;
-    private final List<Edge> fsEdges;
-    private final List<Edge> classmateEdges;
-    private final List<Edge> strangerEdges;
-    private final List<Edge> studyGEdges;
     private final Map<String, List<Edge>> edgesByType;
     private String title = "Network Analysis Report";
 
@@ -60,12 +55,6 @@ public NetworkReportGenerator(Graph<String, Edge> graph,
                 this.edgesByType.put(e.getKey(), e.getValue() != null ? e.getValue() : Collections.<Edge>emptyList());
             }
         }
-        // Maintain backward-compatible field access for subclasses/tests
-        this.friendEdges = this.edgesByType.containsKey("f") ? this.edgesByType.get("f") : Collections.<Edge>emptyList();
-        this.fsEdges = this.edgesByType.containsKey("fs") ? this.edgesByType.get("fs") : Collections.<Edge>emptyList();
-        this.classmateEdges = this.edgesByType.containsKey("c") ? this.edgesByType.get("c") : Collections.<Edge>emptyList();
-        this.strangerEdges = this.edgesByType.containsKey("s") ? this.edgesByType.get("s") : Collections.<Edge>emptyList();
-        this.studyGEdges = this.edgesByType.containsKey("sg") ? this.edgesByType.get("sg") : Collections.<Edge>emptyList();
     }
 
     /**
@@ -162,8 +151,8 @@ public int compare(Map.Entry<String, Integer> a, Map.Entry<String, Integer> b) {
         int totalEdgeTypes = 0;
         for (int c : edgeTypeCounts) totalEdgeTypes += c;
 
-        // Components (simple BFS)
-        int componentCount = countComponents();
+        // Components
+        int componentCount = GraphUtils.findComponents(graph).size();
 
         // Network health score (0-100)
         int healthScore = computeHealthScore(nodeCount, edgeCount, density, isolatedCount, componentCount);
@@ -256,29 +245,6 @@ public int compare(Map.Entry<String, Integer> a, Map.Entry<String, Integer> b) {
         return sb.toString();
     }
 
-    private int countComponents() {
-        Set<String> visited = new HashSet<String>();
-        int components = 0;
-        for (String v : graph.getVertices()) {
-            if (!visited.contains(v)) {
-                components++;
-                Queue<String> queue = new ArrayDeque<String>();
-                queue.add(v);
-                visited.add(v);
-                while (!queue.isEmpty()) {
-                    String curr = queue.poll();
-                    for (String neighbor : graph.getNeighbors(curr)) {
-                        if (!visited.contains(neighbor)) {
-                            visited.add(neighbor);
-                            queue.add(neighbor);
-                        }
-                    }
-                }
-            }
-        }
-        return components;
-    }
-
     private int computeHealthScore(int nodes, int edges, double density, int isolated, int components) {
         int score = 100;
         // Penalize for too many isolated nodes