Breaking News: Grepper is joining You.com. Read the official announcement!

Count number of nodes in each connected part of an undirected unweighted graph

Xenophobic Xenomorph answered on May 28, 2020 Popularity 3/10 Helpfulness 1/10

answer Count number of nodes in each connected part of an undirected unweighted graph

Count number of nodes in each connected part of an undirected unweighted graph

Comment

void DFS(int start, vector<int> v[],vector<int> &visited, int &count)
{
  visited[start] = 1;
  count++;
  for(int i= 0; i<v[start].size(); ++i)
  {        
    if(visited[v[start][i]] == 0)
        DFS(v[start][i], v, visited);        
  }    
}
---------------------------------------------------
  for(int i=1;i<=n;++i)
{
  if(visited[i] == 0 )
  {
     connected++;
     int count=0;
     DFS(i,v,visited,count);
     cout<<"This component has "<<count<<" nodes"<<"\n";
  }        
}

Popularity 3/10 Helpfulness 1/10 Language javascript

Source: stackoverflow.com

Tags: count each javascript nodes

Link to this answer
Share Copy Link