.

myselfshravan · myselfshravan · commit 210b3dcd38c6 · 2023-08-13T15:50:31.000+05:30
diff --git a/10.krushkal.c b/10.krushkal.c
@@ -26,7 +26,7 @@ void main()
         }
     }
 
-    printf("The edges of Minimum Cost Spanning Tree are\n");
+    printf("\nThe edges of Minimum Cost Spanning Tree are\n");
     while (ne < n)
     {
         for (i = 1, min = 999; i <= n; i++)
diff --git a/12.Travelling_Salesman.c b/12.Travelling_Salesman.c
@@ -10,7 +10,7 @@ void get()
     printf("\nEnter Cost Matrix: \n");
     for (i = 0; i < n; i++)
     {
-        // printf("\nEnter Elements of Row #: %d\n", i + 1);
+        // printf("Enter Elements of Row #: %d\n", i + 1);
         for (j = 0; j < n; j++)
             scanf("%d", &a[i][j]);
         visited[i] = 0;
diff --git a/README.md b/README.md
@@ -211,7 +211,7 @@ Total cost of spanning tree = 8
 Example 1: 
 
 ```bash
-Kruskal's algorithm in C
+Kruskals algorithm in C
 ========================
 Enter the no. of vertices: 5
 Enter the cost adjacency matrix:
@@ -220,6 +220,7 @@ Enter the cost adjacency matrix:
 2 3 0 6 5
 0 0 6 0 0
 1 1 5 0 0
+
 The edges of Minimum Cost Spanning Tree are
 1 edge (1,2) = 1
 2 edge (1,5) = 1
@@ -230,7 +231,7 @@ Minimum cost = 10
 ```
 Example 2:
 ```bash
-Kruskal's algorithm in C
+Kruskals algorithm in C
 ========================
 Enter the no. of vertices: 6
 Enter the cost adjacency matrix:
@@ -240,6 +241,7 @@ Enter the cost adjacency matrix:
 6 0 5 0 0 2
 0 3 6 0 0 6
 0 0 4 2 6 0
+
 The edges of Minimum Cost Spanning Tree are
 1 edge (1,3) = 1
 2 edge (4,6) = 2
@@ -277,7 +279,6 @@ Path= 4<-2<-3<-0
 ```bash
 Enter No.of Cities: 6
 Enter Cost Matrix: 
-
 Enter Elements of Row #: 1
 99 10 15 20 99 8
 Enter Elements of Row #: 2

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@ void main()`
`26`	`26`	`}`
`27`	`27`	`}`
`28`	`28`
`29`		`- printf("The edges of Minimum Cost Spanning Tree are\n");`
	`29`	`+ printf("\nThe edges of Minimum Cost Spanning Tree are\n");`
`30`	`30`	`while (ne < n)`
`31`	`31`	`{`
`32`	`32`	`for (i = 1, min = 999; i <= n; i++)`
Original file line number	Diff line number	Diff line change
`@@ -10,7 +10,7 @@ void get()`
`10`	`10`	`printf("\nEnter Cost Matrix: \n");`
`11`	`11`	`for (i = 0; i < n; i++)`
`12`	`12`	`{`
`13`		`- // printf("\nEnter Elements of Row #: %d\n", i + 1);`
	`13`	`+ // printf("Enter Elements of Row #: %d\n", i + 1);`
`14`	`14`	`for (j = 0; j < n; j++)`
`15`	`15`	`scanf("%d", &a[i][j]);`
`16`	`16`	`visited[i] = 0;`