出差推销员人 [英] Traveeling Salesman Person

问题描述

大家好，

我正在尝试使用优先级队列解决旅行业务员问题.

有人可以帮我如何为两个二元数组的矩阵找到Bound
W [i] [j].

Hello All,

I am trying to solve travelling salesperson problem using priority queue.

Can anybody help me how to find Bound for the matrix which is two dimwnsional array
W[i][j].

推荐答案

Google[^] is your friend - try doing some basic research yourself...

数组W[i][j] 不等效于矩阵；这是一个交错数组，请参见:
http://en.wikipedia.org/wiki/Jagged_array [ http://msdn.microsoft.com/en-us/library/2s05feca.aspx [ ^ ].

绑定矩阵"听起来是错误的.我认为这种表达没有任何意义.

要表示矩阵，请使用W[i, j].

—SA

The array W[i][j] is not equivalent to a matrix; this is a jaggeed array, see:
http://en.wikipedia.org/wiki/Jagged_array[^],
http://msdn.microsoft.com/en-us/library/2s05feca.aspx[^].

"Bound for the matrix" sounds wrong. I don''t think this expression makes any sense.

To represent a matrix, use W[i, j].

—SA

这篇关于出差推销员人的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！