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 exist
Answer» C. minimum four vertices can be there


Discussion

No Comment Found