Adjacency matrix meaning and definition in DSA

Connected component definition & meaning in DSA

Last Updated : 11 Apr, 2023

Connected component in an undirected graph refers to a group of vertices that are connected to each other through edges, but not connected to other vertices outside the group.

For example in the graph shown below, {0, 1, 2} form a connected component and {3, 4} form another connected component.

Example of connected components

Characteristics of Connected Component:

A connected component is a set of vertices in a graph that are connected to each other.
A graph can have multiple connected components.
Inside a component, each vertex is reachable from every other vertex in that component.

How to identify Connected Component:

There are several algorithms to identify Connected Components in a graph. The most popular ones are:

Applications of Connected Component:

Graph Theory: It is used to find subgraphs or clusters of nodes that are connected to each other.
Computer Networks: It is used to discover clusters of nodes or devices that are linked and have similar qualities, such as bandwidth.
Image Processing: Connected components also have usage in image processing.

What else can you read?

Adjacency matrix meaning and definition in DSA

zaidkhan15

Improve

Article Tags :

Practice Tags :

Graph

Similar Reads

Strongly Connected Component meaning in DSA

Strongly Connected Component (SCC) is a concept in graph theory, specifically in directed graphs. A subgraph of a directed graph is considered to be an SCC if and only if for every pair of vertices A and B, there exists a path from A to B and a path from B to A. Properties of Strongly Connected Comp

Adjacency matrix meaning and definition in DSA

An adjacency matrix is a square matrix of N x N size where N is the number of nodes in the graph and it is used to represent the connections between the vertices of a graph. Characteristics of the adjacency matrix are:The size of the matrix is determined by the number of vertices (or nodes) in a gra

Balanced Binary Tree definition & meaning in DSA

Balanced binary tree is defined as a binary tree data structure where there is no more than one height difference between the left and right subtrees of any given node. Mathematically Height of left subtree - Height of right subtree â‰¤1 Properties of Balanced Binary Tree: A balanced binary tree has a

Strongly Connected Components (SCC) in Python

Strongly Connected Components (SCCs) in a directed graph are groups of vertices where each vertex has a path to every other vertex within the same group. SCCs are essential for understanding the connectivity structure of directed graphs. Kosaraju's Algorithm:Kosaraju's algorithm is a popular method

Find Weakly Connected Components in a Directed Graph

Weakly Connected Graph: A directed graph 'G = (V, E)' is weakly connected if the underlying undirected graph Äœ is connected. The underlying undirected graph is the graph Äœ = (V, ÃŠ) where ÃŠ represents the set of undirected edges that is obtained by removing the arrowheads from the directed edges and

Array Definition & Meaning in DSA

An array is a collection of items of same data type stored at contiguous memory locations Types of Arrays:One-dimensional Array: It is the simplest kind of array where all the elements are stored linearly in a single row. Two-dimensional Array: A two-dimensional array is an array with 2 dimensions,

Graph definition & meaning in DSA

A Graph is a non-linear data structure consisting of vertices and edges where two vertices are connected by an edge. Properties of a Graph:Vertices (nodes): The points where edges meet in a graph are known as vertices or nodes. A vertex can represent a physical object, concept, or abstract entity.Ed

Strongly Connected Components

Strongly Connected Components (SCCs) are a fundamental concept in graph theory and algorithms. In a directed graph, a Strongly Connected Component is a subset of vertices where every vertex in the subset is reachable from every other vertex in the same subset by traversing the directed edges. Findin

Disjoint Set meaning and definition in DSA

Disjoint Set is a data structure that keeps track of a set of elements partitioned into a number of disjoint subsets and it is used to efficiently solve problems that involve grouping elements into sets and performing operations on them. Characteristics of the Disjoint Set:It keeps a set partitioned

Singly Linked List definition & meaning DSA

A singly linked list is a special type of linked list in which each node has only one link that points to the next node in the linked list. Characteristics of a Singly Linked List:Each node holds a single value and a reference to the next node in the list.The list has a head, which is a reference to