TSP solving in unity

i have a 10x10 grid, filled with cubes, that contains some amount of "score". there are no distance between cubes, but there still take some time to cross them, because cubes have traps and other things in them. and, some edges are directed. i think its non-typical TSP and i need to cross the grid with minimal time, but cross as much cubes as possible. which algorithm should i use and how can i implement it using navmesh or graph