title: Best algorithm to determine if an undirected graph is a tree
body: <p>What is the time complexity of the Best algorithm to determine if an undirected graph  is a tree??</p>
  
  <p>can we say Big-oh(n) , with n vertices??</p>