Computer Science, asked by ajii23, 6 months ago

A directed graph is ………………. if there is a path from each vertex to every other vertex in

Answers

Answered by kukunuriramakrishna0
0

Explanation:

jgxfhzfsfsksrylsxgraylzylra

Similar questions