User:Raj Sonkar Wiki/sandbox

Raj is greatgeeksforgeeks.org Today I was Exploring the world of google and here I found some of greatest algorithms which are very vital to understand. Some are as follows: 1. Kruskal's algorithm: Kruskal's algorithm is the concept that is introduced in the graph theory of discrete mathematics. It is used to discover the shortest path between two points in a connected weighted graph. This algorithm converts a given graph into the forest, considering each node as a separate tree.For further exploration, you must give a shot link https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm#:~:text=Kruskal's%20algorithm%20is%20the%20concept,node%20as%20a%20separate%20tree. 2. Dijkstra algorithm:Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. To know more, just go to https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/