If there are only two nodes in the graph and they are undirected

So we can go from one node to other easily.So the graph should be a cyclic graph

hello @KetanPandey

yeah u can say that but genrally we dont consider it cyclic.

a-----b (if u r looking it this way then it is not cyclic)

but if u r spiliting this edge (----) in two edges( —> , <— ) of equal weight then u can say that it is cyclic.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.