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