Function ADS::matrixChain

• Defined in File MatrixChain.h

Function Documentation

inline std::pair<long, std::vector<std::vector<std::size_t>>> ADS::matrixChain(const std::vector<long> &c)

parentesizzazione(): the least cost DP[ 0 ][ n - 1 ] and the table S of the splits, for the n matrices of sizes c[ 0 .

. n ]

Pre:

c is not empty and its items are positive