CSD203_-_FA_2022_-_FE_240.webp

Answer (Choose 1 answer)
Multiple choices 2/50
A graph in which exists a path between any two nodes is called
A. Digraph
B. In-directed graph
C. Complete graph
D. Connected graph
Next
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21 22
23
24 25 26 27 28
29
30
31
32
33
34
35
36
37
38
39
40 41
42
43
44
45 46 47 48
49 50