Dijkstra’s algorithm is a popular algorithm used to find the shortest path between a source vertex and all other vertices in a weighted graph. It…
Continue Reading
Depth-First Search is a graph traversal algorithm that explores all the vertices of a graph by going as deep as possible before backtracking. It starts…
Continue Reading
Breadth-First Search is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order, i.e., it visits all the vertices at…
Continue Reading
Kruskal’s algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, weighted graph. The MST is a subgraph of…
Continue Reading