weighted graph

hi every1

could any body help me with this problem please?

given a complete weightd graph, find the tour with the minimal possible weight.

fiding the brute-force algorithm for this problem

Many thanks :confused:

Newbie Poster

2 posts since Nov 2004

Reputation Points: 10

Solved Threads: 0

I tried Google "weighted graph traversal algorithm" and it gave a bunch of interesting links, such as this one:

Posting Pro in Training

436 posts since Jun 2004

Reputation Points: 36

Solved Threads: 11

This article has been dead for over three months

You