Programming, Machine Learning, Data Science, Technology, Artificial Intelligence.
the basics: 11. Kruskal → is for the finding of minimum spanning tree 12. Floyd Warshall → Help you find the shortest paths in a graph 13. Union → is found to detect cycles in the graph 14. Bellman-Ford → shortest path in the graph 15. Lee → for finding the shortest path in a maze If you are