Longest acyclic path in a directed unweighted graph

Question

What algorithm can be used to find the longest path in an unweighted directed acyclic graph?

Answer 1

Wikipedia has an algorithm: http://en.wikipedia.org/wiki/Longest_path_problem

Looks like they use weightings, but should work with weightings all set to 1.