com.github.mdr.ascii.layout.layering
For each vertex in the given graph (which must be acyclic), calculate the length of the longest path to a sink.
(Since version ) see corresponding Javadoc for more information.