|
-
August 2nd, 2001, 08:07 PM
#1
Chinese Postman Algorithm?
Has anyone seen any visual basic routines or just the basic alogrithm's for solving the "Chinese Postman" problem? (The shortest path that visits every node at least once.)
Thanks
MAK
-
August 3rd, 2001, 08:30 AM
#2
Re: Chinese Postman Algorithm?
Post rules and starting point of this game.
Special thanks to Lothar "the Great" Haensler, Tom Archer, Chris Eastwood, TCartwright, Bruno Paris
and all the other wonderful people who made and make Codeguru a great place.
Come back soon, you Gurus.
The Rater
...at present time, using mainly Net 4.0, Vs 2010
Special thanks to Lothar "the Great" Haensler, Chris Eastwood , dr_Michael, ClearCode, Iouri and
all the other wonderful people who made and make Codeguru a great place.
Come back soon, you Gurus.
-
August 3rd, 2001, 09:21 AM
#3
Re: Chinese Postman Algorithm?
Go to this address http://www.cs.mdx.ac.uk/harold/cpp/default.htm, there is a code posted there but it is in Java, so is a good startup if you at least want the algorithm.
Hope this helps.
-
August 3rd, 2001, 10:54 AM
#4
Re: Chinese Postman Algorithm?
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|