def testName(self):
path = get_max_tree_node_path([[5]])
self.assertEqual(path, 5)
path = get_max_tree_node_path([[5], [6, 7]])
self.assertEqual(path, 12)
path = get_max_tree_node_path([[5], [6, 7], [10, 9, 8]])
self.assertEqual(path, 21)
path = get_max_tree_node_path([[5], [6, 7], [10, 9, 8], [11, 12, 13, 14]])
self.assertEqual(path, 34)
'''
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
3
7 4
2 4 6
8 5 9 3
That is, 3 + 7 + 4 + 9 = 23.
Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.
'''
from grid_builder import get_grid
from tree_node_path import get_max_tree_node_path
if __name__ == '__main__':
grid = get_grid('../input/67.txt')
print get_max_tree_node_path(grid)
