Finding Shortest Paths
Given an m x n matrix of integers, structure a program that
computes a path of minimal weight. The
weight of a path is the sum of the integers in each of the n cells
of the matrix, that are visited. A path
starts anywhere in column 1 (the first column) and consists of a
sequence of steps terminating in column n
(the last column). A step consists of traveling from column
i to column i + 1 in an adjacent (horizontal or
diagonal) row. For example, a 5x 6 matrix and its shortest path are
shown below:
Finding Shortest Paths Given An M X N Matrix Of Integers Structure A Program That Computes A Path Of Minimal Weight Th 1 (116.15 KiB) Viewed 32 times