I think 1 connected component will be answer

The Gateway to Computer Science Excellence

+7 votes

0

@rohit gupta,

2 ->4->6->-----12-->120

3->6-->-----12-----120

5--->-----20----->---

7----->-------14------->----

all chains will connect somewhere, so graph will be connected.

2 ->4->6->-----12-->120

3->6-->-----12-----120

5--->-----20----->---

7----->-------14------->----

all chains will connect somewhere, so graph will be connected.

0

@Manu What type of connected components are being referred here? Because for directed graph we have strongly connected components and weakly connected components.

**There is an edge from a to b if b = K * a where ***k is any natural number*

Take k = 1

2-->3-->4...........-->120

3-->4...........-->120

4...........-->120

..................

119-->120

Weakly connected components = 1

Strongly connected components = 119

+5 votes

Best answer

+1

if you are stuck finding prime numbers just follow this trick->

to find if n is prime or not folow the procedure

1.find (square root of n)

2.now try to divide n only by the numbers <= (square root of n).

3.if it is not divisible by any then it is prime.

IT will save your time

to find if n is prime or not folow the procedure

1.find (square root of n)

2.now try to divide n only by the numbers <= (square root of n).

3.if it is not divisible by any then it is prime.

IT will save your time

52,217 questions

59,951 answers

201,132 comments

118,172 users