Given a DAG, return the longest path in the graph.
Input: String[][] [["NYC","SFO"], ["SFO","LAX"],["LAX","SEA"],["PDX","SEA"]]
Return: List NYC -> SFO -> LAX -> SEA