C++ implementation of the algorithm to find number of connected components in a graph.
KunalKartik02 opened this issue · comments
This is a(n):
- New algorithm
- Update to an existing algorithm
- Error
- Proposal to the Repository
Details:
Given an undirected graph with n nodesFind the number of connected components in the given graph.
@AdiChat please accept this issue with hacktoberfest tag,assign it to me and review my https://github.com/OpenGenus/cosmos/pull/6556 here.
@KunalKartik02 Can you assign this to me ? I have the solution ready.
Can you please assign this issue to me?
Details:
Given an undirected graph with n nodes
Find the number of connected components in the given graph.
- I will be adding solution problem with 3 different approaches i.e. BFS, DFS, Union Find.
- I will be adding comments and discussing the time complexity of the approaches.
- I have read the contribution guidelines and the style guides for the languages.
- I will also be adding the test file for the problem.
Please assign this issue to me.
Please Assign the task to me, the solution for the issue is ready. Thanks !
@KunalKartik02 Can you assign this issue to me.