Created
December 23, 2015 11:43
-
-
Save CsengerG/0a387ded2203b85d3502 to your computer and use it in GitHub Desktop.
Count a number of components in a graph
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int number_of_components = 0 | |
| for(int i=0;i<N;++i){ | |
| if(explored[i]==false){ | |
| dfs(i); | |
| number_of_components++; | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment