...
Hashing
December 31, 2024
Computer-Graphics
January 1, 2025
Hashing
December 31, 2024
Computer-Graphics
January 1, 2025

Data-Structures

Question 93

How many edges are there in a forest with p components having n vertices in all?

A
n-p
Question 93 Explanation: 
Forest is a graph with no cycle.
Now, ‘0’ edges for p-1 vertices (p-1 components) and n-p edges for n-p+1 vertices (1 component).
So, total of n-p edges for p components.
Correct Answer: A
Question 93 Explanation: 
Forest is a graph with no cycle.
Now, ‘0’ edges for p-1 vertices (p-1 components) and n-p edges for n-p+1 vertices (1 component).
So, total of n-p edges for p components.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x