Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #54.9K
Hi guys so I am making function for my graphs (adjacency matrices) to return number of connected components using breadth first search algorithm. It almost works properly. It returns proper value if number of components is equal to number of vertices, but if number of components is smaller than number … |
|
Hello everyone, I want to implement Kruskal algorithm for finding minimum spanning tree in Adjacency Matrix for my program. So I want to write method Graph& getMinSpanningTree() . I have 2 classes: class Graph { public: /* Adds an edge between given vertices. Third argument is a weight of an … |