prove that in a diagraph D ,every vertex y is reachable from a vertex x if and only if ,D contains an (x-y) path
Answers
Answered by
0
Answer:
wait for one minute I'm sending pic
Step-by-step explanation:
wait for one minute I'm sending pic
Similar questions