# Tag Archives: connected-components

## Minimize cost to color all the vertices of an Undirected Graph using given operation

Given two integers V and E representing the number of vertices and edges of an undirected graph G(V, E), a list of edges EdgeList, and… Read More »

## Hexadecimal equivalents in Binary Valued Graph

Given a binary valued undirected graph with V vertices and E edges, the task is to find the hexadecimal equivalents of all the connected components… Read More »

## Maximum decimal equivalent possible among all connected components of a Binary Valued Graph

Given a binary valued Undirected Graph with V vertices and E edges, the task is to find the maximum decimal equivalent among all the connected… Read More »

## Octal equivalents of connected components in Binary valued graph

Given a binary valued undirected graph with V vertices and E edges, the task is to find the octal equivalents of all the connected components… Read More »

## Maximum sum of values of nodes among all connected components of an undirected graph

Given an undirected graph with V vertices and E edges. Every node has been assigned a given value. The task is to find the connected… Read More »

## Count of unique lengths of connected components for an undirected graph using STL

Given an undirected graph, the task is to find the size of each connected component and print the number of unique sizes of connected components… Read More »

## Check if the length of all connected components is a Fibonacci number

Given an undirected graph with V vertices and E edges, the task is to find all the connected components of the graph and check if… Read More »