Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices.