How to check if a graph is not a tree?

Question

How to check if a given is undirected graph

tree

or not? Is there any correlation between the two?

I thought to check if the graph is connected or not? But is that enough?

+3

CoderIam Jul 20. 15 at 11:02

1 answer

poorvankBhatia · Accepted Answer · 2015-07-20T11:09:55+0000

None for an undirected graph, which must be a tree u, must be checked for 2 conditions.

1) The graph must be connected.

2) There should be no cycle.

DFS / BFS can be used to test both cases.