OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: repeated sentences

Browse Source
This commit is contained in:
Ayaan Khan 2020-06-25 15:49:30 +05:30
parent 5d48e651d1
commit 05789603ab
1 changed files with 3 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
graph/connected_components.cpp
View File

@ -1,9 +1,9 @@
/** /**
* *
* \file * \file
* \brief [Connected Components * \brief [Graph Connected Components
* (Connected * (Connected Components)]
* Components)](https://en.wikipedia.org/wiki/Component_(graph_theory)) * (https://en.wikipedia.org/wiki/Component_(graph_theory))
* *
* \author [Ayaan Khan](http://github.com/ayaankhan98) * \author [Ayaan Khan](http://github.com/ayaankhan98)
* *
@ -42,10 +42,7 @@ class graph {
/** \brief keep track of connected components */ /** \brief keep track of connected components */
int connected_components; int connected_components;
/** \brief Utility function to perform depth first search on graph */
void depth_first_search(); void depth_first_search();
/** \brief Utility function that explores given vertex in graph */
void explore(int, vector<bool> &); void explore(int, vector<bool> &);
public: public:
@ -55,7 +52,6 @@ class graph {
*/ */
explicit graph(int n) : adj(n, vector<int>()) { connected_components = 0; } explicit graph(int n) : adj(n, vector<int>()) { connected_components = 0; }
/** \brief Function to add a edge between two nodes or vertices of graph */
void addEdge(int, int); void addEdge(int, int);
/** /**