No self-introduction
Loading
Profile
Follow
codes (2)
Pre-push flow Algorithm
no vote
Push - release algorithm is the most effective algorithm to calculate the maximum flow
abhijeetakamble 0 0
1
Kruskal's Algorithm using union find
no vote
Kruskal's algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph.
This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the
edges in the tree is minimized. If the graph is not connected, then it finds a minimum spanning forest (a minimum spanning
tree for each connected component).
A union-find algorithm is an algorithm that performs two useful operations on such a data structure:
abhijeetakamble 0 0
1
No more~
Follows0
Fans0