“…Based on five trials using the multipath DFS algorithm, a path was chosen with the smallest cost value in the 5th experiment with paths [13,6,2,3,11,20] and a cost of 1206.88. The alternative path was path [13,6,2,8,3,11,20] with a cost value of 1440.84, and path [13,6,2,9,3,11,20] with a cost value of 1444.02. Meanwhile, from five trials using the Dijkstra multipath algorithm, there was a path with the smallest cost value in the 4th experiment with path [13,6,2,3,11,20] and a cost value of 1263.05.…”