Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged connected-components
1
votes
1
answer
1
CMI2018-B-5
Let $G=(V,E)$ be an undirected graph and $V=\{1,2,\cdots,n\}.$ The input graph is given to you by a $0-1$ matrix $A$ of size $n\times n$ as follows. For any $1\leq i,j\leq n,$ the entry $A[i,j]=1$ if and only if ... any two vertices are connected to each other by paths. Give a simple algorithm to find the number of connected components in $G.$ Analyze the time taken by your procedure.
Let $G=(V,E)$ be an undirected graph and $V=\{1,2,\cdots,n\}.$ The input graph is given to you by a $0-1$ matrix $A$ of size $n\times n$ as follows. For any $1\leq i,j\...
gatecse
438
views
gatecse
asked
Sep 13, 2019
Graph Theory
cmi2018
graph-theory
undirected-graph
graph-connectivity
connected-components
descriptive
+
–
3
votes
3
answers
2
PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y Find number of strongly connected components
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides yFind number of strongly connected com...
Tesla!
1.2k
views
Tesla!
asked
Apr 30, 2017
Graph Theory
iiith-pgee
graph-theory
connected-components
+
–
3
votes
1
answer
3
GATE Overflow | Data Structures | Test 1 | Question: 18
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___
The maximum number of possible edges in an undirected simple graph with $100$ vertices and $5$ components is ___
Arjun
518
views
Arjun
asked
Oct 10, 2016
DS
go-ds-1
data-structures
graph-theory
connected-components
numerical-answers
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register