Sakshi Khachane

Kruskal's algorithm

1

Description - Adding Kruskal's Algorithm in the graph section which is used to find the minimum cost spanning tree. @Abhijit2505 Please assign me this issue under SWOC.

Dijkstra's algorithm

1

Adding Dijkstra's algorithm in the graph section which is an algorithm for finding the shortest paths between nodes in a graph.