non cycled graph algorihm

Question

Hi, This is my first question so i hope i asked in the right forume. I'm looking an efficient algorithm for checking if a graph is non cycled (I though I could use DFS). And another algorithm to find if a graph is connected when (i.e. all the nodes connected , here also I though of using DFS). Thanks