def METHOD_NAME(self):
    g = vs_graphcore.HierGraph()
    g.addHierRootNode('A')
    for i in range(ord('B'), ord('U')):
        g.addNode(chr(i))
    g.addEdgeByNids('A', 'B')
    g.addEdgeByNids('A', 'C')
    g.addEdgeByNids('B', 'D')
    g.addEdgeByNids('B', 'E')
    g.addEdgeByNids('D', 'F')
    g.addEdgeByNids('E', 'F')
    g.addEdgeByNids('C', 'G')
    g.addEdgeByNids('F', 'G')
    g.addEdgeByNids('G', 'H')
    g.addEdgeByNids('G', 'I')
    g.addEdgeByNids('H', 'J')
    g.addEdgeByNids('H', 'K')
    g.addEdgeByNids('J', 'L')
    g.addEdgeByNids('K', 'L')
    g.addEdgeByNids('I', 'L')
    g.addEdgeByNids('L', 'M')
    g.addEdgeByNids('L', 'Q')
    g.addEdgeByNids('Q', 'R')
    g.addEdgeByNids('Q', 'S')
    g.addEdgeByNids('R', 'T')
    g.addEdgeByNids('S', 'T')
    g.addEdgeByNids('T', 'G')
    g.addEdgeByNids('M', 'N')
    g.addEdgeByNids('M', 'O')
    g.addEdgeByNids('N', 'P')
    g.addEdgeByNids('O', 'P')
    pathgenr = viv_graph.getLongPath(g)
    longpath = next(pathgenr)
    self.assertEqual(len(longpath), 11)