Page 1 of 1
Kruskal's MSP algorithm has running time in terms of number of vertices n with number of edges k ~ n O(n) O(Ig(n)) O(n*l
Posted: Tue Jul 12, 2022 8:21 am
by answerhappygod
- Kruskal S Msp Algorithm Has Running Time In Terms Of Number Of Vertices N With Number Of Edges K N O N O Ig N O N L 1 (43.13 KiB) Viewed 20 times
Kruskal's MSP algorithm has running time in terms of number of vertices n with number of edges k ~ n O(n) O(Ig(n)) O(n*lg(n)) O(n^2) O(n^2*lg(n)) O(n^3) other Binomial coefficient calculation algorithm is an example of following type of algorithm: Backtracking Other Greedy Dynamic Programming