E is the number of edges present in graph G. You need to take input in main and create a function which should return all the connected components. And then print them in the main, not inside function ...

Abstract: Graph ... not exist a de facto “best” architecture, language, or algorithmic approach that simultaneously balances performance, energy efficiency, portability, and productivity. In this ...