If two vertices point to one another in a directed graph, is the graph then considered cyclic? Suppose you have a directed graph. Vertices a and b are part of the graph. There is an arrow pointing from a to b and an arrow pointing from b to a. Does this make the directed graph cyclic?
Yes the graph is cyclic. It does not matter how many vertices are there. If a cycle can be formed then the graph is cyclic. You can even form a cyclic graph with one node. This cycle would be called a self loop.