In an undirected graph, a connected component is a subgraph in which any two vertices are connected to each other by paths. Usual algorithms build a graph where each vertex is labeled with its component number. They use a search from an unclassified vertex to build the connected component containing this vertex. The process repeats until all vertices are labeled with a component. Vertices that are not connected form a component with only one vertex. <!–more– In an edge-centric BSP implementation, like GraphX, finding all the connected components is done in parallel using Pregel iterations:

With the advent of the Qt Installer FrameWork (QtIFW), it has never been easier to provide installers for your Qt based applications. Such installers can be either online (i.e. they fetch contents from the internet from repositories during the installation process, thus allowing updates), or offline (i.e. all the contents is bundled into the installer). QtIFW allows installers to be built for different platforms including Windows, MacOS and Linux.