From bdfac07412af041e0fb93b02eea5d9acdf4b72b9 Mon Sep 17 00:00:00 2001
From: Nishant Rana <94187nishant@gmail.com>
Date: Fri, 26 Dec 2025 12:24:12 +0530
Subject: [PATCH] change some code structure

---
 graph_adjacency-matrix.py | 107 +++++++++++++++++++++++---------------
 1 file changed, 65 insertions(+), 42 deletions(-)

diff --git a/graph_adjacency-matrix.py b/graph_adjacency-matrix.py
index 3f315001..2a9801b4 100644
--- a/graph_adjacency-matrix.py
+++ b/graph_adjacency-matrix.py
@@ -1,50 +1,73 @@
-# implementation of an undirected graph using Adjacency Matrix, with weighted or unweighted edges
-# its definitely work
+# Implementation of an undirected graph using Adjacency Matrix
+
 class Vertex:
-	def __init__(self, n):
-		self.name = n
+    def __init__(self, name):
+        self.name = name
+
 
 class Graph:
-	vertices = {}
-	edges = []
-	edge_indices = {}
-	
-	def add_vertex(self, vertex):
-		if isinstance(vertex, Vertex) and vertex.name not in self.vertices:
-			self.vertices[vertex.name] = vertex
-			for row in self.edges:
-				row.append(0)
-			self.edges.append([0] * (len(self.edges)+1))
-			self.edge_indices[vertex.name] = len(self.edge_indices)
-			return True
-		else:
-			return False
-	
-	def add_edge(self, u, v, weight=1):
-		if u in self.vertices and v in self.vertices:
-			self.edges[self.edge_indices[u]][self.edge_indices[v]] = weight
-			self.edges[self.edge_indices[v]][self.edge_indices[u]] = weight
-			return True
-		else:
-			return False
-			
-	def print_graph(self):
-		for v, i in sorted(self.edge_indices.items()):
-			print(v + ' ', end='')
-			for j in range(len(self.edges)):
-				print(self.edges[i][j], end='')
-			print(' ')    
+    def __init__(self):
+        self.vertices = {}        # vertex_name -> Vertex
+        self.edges = []           # adjacency matrix
+        self.edge_indices = {}    # vertex_name -> index
+
+    def add_vertex(self, vertex):
+        # Validate input
+        if not isinstance(vertex, Vertex):
+            return False
+
+        if vertex.name in self.vertices:
+            return False
+
+        # 1. Add vertex
+        self.vertices[vertex.name] = vertex
+
+        # 2. Expand existing rows (add new column)
+        for row in self.edges:
+            row.append(0)
+
+        # 3. Add new row initialized with zeros
+        self.edges.append([0] * (len(self.edges) + 1))
+
+        # 4. Assign index to vertex
+        self.edge_indices[vertex.name] = len(self.edge_indices)
+
+        return True
+
+    def add_edge(self, u, v, weight=1):
+        if u not in self.vertices or v not in self.vertices:
+            return False
+
+        i = self.edge_indices[u]
+        j = self.edge_indices[v]
+
+        # Undirected graph
+        self.edges[i][j] = weight
+        self.edges[j][i] = weight
+
+        return True
+
+    def print_graph(self):
+        for vertex, i in sorted(self.edge_indices.items()):
+            print(vertex, end=" ")
+            for value in self.edges[i]:
+                print(value, end=" ")
+            print()
+ 
 
 g = Graph()
-# print(str(len(g.vertices)))
-a = Vertex('A')
-g.add_vertex(a)
-g.add_vertex(Vertex('B'))
-for i in range(ord('A'), ord('K')):
-	g.add_vertex(Vertex(chr(i)))
-
-edges = ['AB', 'AE', 'BF', 'CG', 'DE', 'DH', 'EH', 'FG', 'FI', 'FJ', 'GJ', 'HI']
+
+# Add vertices
+for ch in range(ord('A'), ord('K')):
+    g.add_vertex(Vertex(chr(ch)))
+
+# Add edges
+edges = ['AB', 'AE', 'BF', 'CG', 'DE', 'DH', 'EH',
+         'FG', 'FI', 'FJ', 'GJ', 'HI']
+
 for edge in edges:
-	g.add_edge(edge[:1], edge[1:])
+    g.add_edge(edge[0], edge[1])
 
+# Print graph
 g.print_graph()
+