min-path This is a simple project which can compute the minimum path over a triangle of numbers. Given the triangle: 7 6 3 3 8 5 11 2 10 9 the minimum path would be 7 + 6 + 3 + 2 = 18 Running the code sbt 'run "7" "6 3" "3 8 5" "11 2 10 9"' will run the project.