Traveeling Salesman Person

Question

1.00/5 (1 vote)

See more:

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].

Posted 22-Nov-11 20:02pm

Member 8146174

Add a Solution

Comments

Sergey Alexandrovich Kryukov 23-Nov-11 2:05am

Homework? What's already done? Any particular problem?
--SA

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2011-11-22T21:01:00

Solution 1

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

Posted 22-Nov-11 21:01pm

OriginalGriff

Sergey Alexandrovich Kryukov · Answer 2 · 2011-11-22T21:15:00

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