I have understood and implemented Prim's and Kruskal's algorithm using adjacency matrix but I am not understanding how to write a program using adjace ...
I don't understand why we are increasing e += 1 when the parents are not same. And why the while loop stops based on e's value? Why we need that index ...
I am trying to sort an array of structs using qsort, but it's not properly sorting the content. The structure node consists of the starting vertex, th ...
Algorithm does not pass through vertex 1(Z) and 4(B). Cycles are for vertices 12-13-14(S-T-K) and 13-15-16(T-L-R), how to fix it? Below is the comman ...
Upon analyzing Kruskal's Algorithm, Kruskal's Algorithm is apparently considered to be E log E because "for an MST to exist, E can't be smaller than V ...
I'm reading CLRS Algorithms Edition 3 and I have two problems for my homework (I'm not asking for answers, I promise!). They are essentially the same ...
In this code I want to make Kruskal's algorithm, which calculates a minimum spanning tree of a given graph. And I want to use min-heap and disjoint se ...
The question was on Leetcode 1584. Min Cost to Connect All Points. My answer to this question is: My answer can pass all the test cases but the spe ...
Given an Undirected graph G with with weight on its edges and 2 different minimal spanning trees: T, T' Then I want to prove the following: For e ...
How does these two functions work ? The time complexity of the function find is O(log n) assuming that the length of each chain is O(log n). In this ...
According to GeeksForGeeks, the steps to find Minimal Spanning Tree in an undirected graph are : Sort all the edges in non-decreasing order of the ...
G is an undirected connected graph with positive costs on all edges. Given is edge e whose cost is strictly more than 10. We need to answer whether th ...
I have written this code which implements the Kruskal's algorithm for Minimum Spanning Tree, which yields segmentation fault when I submit it to an on ...
I'm taking Andrew Ng's course on Machine Learning on Coursera. While discussing clustering, he tells us that K- means clustering algorithm is the most ...
I have an MST and need to delete a node. I know that there's an algorithm for that in O(log^4(n)) but since the MST contains less than 50 nodes and 25 ...
I am trying to implement kruskal's algo. togather with bfs and dfs. i wrote my code to print the adjancey list and to show the bfs and dfs and now i a ...
i tried to implement Kruskal´s Minimal Spanning Tree in Java. I´m using Eclipse for writing. I used this website (https://www.geeksforgeeks.org/kruska ...
I have some data and I need to compare the average but I am looking for quick method to introduce each sample in the test. Would be it possible doi ...
I am trying to solve a modification of the following problem: https://codereview.stackexchange.com/questions/135915/sum-of-all-paths-between-all-pairs ...
I have written my code using a nested HashMap and i'm trying to figure out how to put all values pointed by the key of the inner map into an ArrayList ...