What would be a good way to find in a directed graph a path which has the biggest number of nodes? 

I suppose I could traverse the graph in depth for each node and find out which path has the biggest number of nodes however I'm wondering if there are better approaches.

Mention: the graph is guaranteed to have no cycles.