InterviewSolution
Saved Bookmarks
| 1. |
A directed graph or digraph can have directed cycle in which ______(a) starting node and ending node are different(b) starting node and ending node are same(c) minimum four vertices can be there(d) ending node does not existThe question was posed to me by my college director while I was bunking the class.Question is from Graphs topic in portion Graphs of Discrete Mathematics |
|
Answer» The correct choice is (b) starting node and ending node are same |
|