A directed graph or digraph can have directed cycle in which

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
The correct choice is B. starting node and ending node are same
Easiest explanation: If the start node and end node are same in the path of a graph then it is termed as directed cycle i.e, c0 = cn. For instance, a c b a is a simple cycle in which start and end nodes are same A.. But, a c b b a is not a simple cycle as there is a loop <b,b>.