Does a graph with distinct weight on edges exists that prim and kruskal algorithm produce different trees ?
Hello guys . I have a problem with reading editorials . I dont know how to read them . once I read the editorial I dont learn from it I just understand how to solve that problem . I feel like its an idea to solve just this problem and cant use it on others . does anyone has any suggestion ?