Computer Science, asked by testdummyhere1212, 2 months ago

A node v of simple diagraph is said to be ___________ from the node u o the same graph, if there exist a parth from u to v.
a) Graphs
b) Reachable
c) Walk
d) Connected

Answers

Answered by vedprakashj217
2

Connected

I hope it's help full

Similar questions