Maximal Tourism | Editorial by aksingh007

The problem is simply to find the **size of largest connected component** in the given graph. This can be done using DFS or BFS traversal.
**Time complexity:** O(|V|+|E|)

```
//code by aksingh007
#include<iostream>
#include <list>
#include<algorithm>
using namespace std;
int maxi=-1;
int c=0;

class Unused{
    public:
    int tot;
    void printit(){
        cout<<"CONNECTED COMPONENTS ARE AS FOLLOWS\n";
    }
};
class Graph{
	int V; // No. of vertices
	list<int> *adj;
	void DFSUtil(int v, bool visited[]);
public:
	Graph(int V); // Constructor
	void addEdge(int v, int w);
	void cC();
};
void Graph::cC(){
	bool *visited = new bool[V];
	for(int v = 0; v < V; v++)
		visited[v] = false;
	for (int v=0; v<V; v++){
		if (visited[v] == false){
            c=0;
			DFSUtil(v, visited);
            if(maxi<c)
                maxi=c;
		}
	}
}

void Graph::DFSUtil(int v, bool visited[]){
	visited[v] = true;
    c++;
	list<int>::iterator i;
	for(i = adj[v].begin(); i != adj[v].end(); ++i)
		if(!visited[*i])
			DFSUtil(*i, visited);
}
Graph::Graph(int V){
	this->V = V;
	adj = new list<int>[V];
}
void Graph::addEdge(int v, int w){
	adj[v].push_back(w);
	adj[w].push_back(v);
}

int main(){
	int edges;
    int n,e,a,b;
    cin>>n>>e;
    edges=e;
    Unused use;
    use.tot=0;
	Graph g(n); // N vertices numbered from 0 N
    while(e--){
        cin>>a>>b;
        if(a==b)
            continue;
	g.addEdge(a-1, b-1);
   }
	g.cC();
    cout<<maxi;
	return 0;
}
```

Maximal Tourism | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?