Graph Representations

akashdeep023 · akashdeep023 · commit fde4e571a879 · 2024-10-11T03:30:47.000+05:30
diff --git a/33-Graphs_(Part-I)/GraphsP1.java b/33-Graphs_(Part-I)/GraphsP1.java
@@ -27,6 +27,12 @@ public static void main(String[] args) {
          * 
          * 2. Un-Weighted
          *    Ex: Weight of Edge = None
+         * 
+         * Graph Representations (Storing a Graph) --------------------------------
+         * 1. Adjacency List (Important) -> Array<ArrayList><Edge><src,dest,wt> , TC -> O(K) where K is your neighbours length
+         * 2. Adjacency Matrix -> (i,j) connect sotre 1 ya weight otherwise store 0 , TC -> O(V) where V is vertices count
+         * 3. Edge List
+         * 4. 2d Matris (Implicit Graph)
          */
 
     }

Original file line number	Diff line number	Diff line change
`@@ -27,6 +27,12 @@ public static void main(String[] args) {`
`27`	`27`	`*`
`28`	`28`	`* 2. Un-Weighted`
`29`	`29`	`* Ex: Weight of Edge = None`
	`30`	`+ *`
	`31`	`+ * Graph Representations (Storing a Graph) --------------------------------`
	`32`	`+ * 1. Adjacency List (Important) -> Array<ArrayList><Edge><src,dest,wt> , TC -> O(K) where K is your neighbours length`
	`33`	`+ * 2. Adjacency Matrix -> (i,j) connect sotre 1 ya weight otherwise store 0 , TC -> O(V) where V is vertices count`
	`34`	`+ * 3. Edge List`
	`35`	`+ * 4. 2d Matris (Implicit Graph)`
`30`	`36`	`*/`
`31`	`37`
`32`	`38`	`}`