Determining whether or not a directed or undirected graph is a tree

Question

I would like to know of a fast algorithm to determine if a directed or undirected graph is a tree.

This post seems to deal with it, but it is not very clear; accordi

Answer 1

If an undirected given graph is a tree:

• the graph is connected
• the number of edges equals the number of nodes - 1.