Implement the search(source, destination) procedure between cities. Define a map consisting of at least 8 cities. Give each city a name and define some connections (unidirectional) between cities. Include a few cycles in your map. For your internal representation assign an integer to each name. Write a main function that asks for two cities, source and destination, by name. The names should be converted to integers and the search function should be called. (Show at least 3 different searches). After finding a path, print the names of the cities instead of the integers. You can do this while coming out of recursion calls; or after the path is formed with integers, the main function can call a function that will transform the integers back to names. Draw your map on paper and submit it along with your program.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
The program needs to be done in Microsoft Visual C++ 6.0, using Windows 98 or Windows XP.