#Given some graph, find the longest path that exists within it.
#this is a very open ended question, but we can solve any variant of this using depth-first-search on each node.
#This would lead to an O(N^2) output.


def findLongestGraphPath(root):
    pass