[algogeeks] Graph MST problem

Hi, Please help me to solve following problems Let *G *= (*V; E;w*) be a weighted undirected graph whose edges are colored either red or green. That is *E *= *Er [ Eg *and *Er \ Eg *= *;*, where *Er *are the red edges and *Eg *are the green edges. Assume that all edge weights are distinct (so

[algogeeks] Q: Find time complexity in the following implementations in Kruskal's minimal spanning tree algo.

Hello, I am trying to find time complexity of Kruskal's algorithm in the following implementations 1. Linked lis 2. Linked list with weighted union heuristic 3. Trees 4. Trees with only union by rank 5. Trees with union by rank and path compression. All 5 implementations considering for connecte