Abstract
A travelling salesman lives in Doncaster and has to visit Aberdeen, Bradford and Cardiff. If he knows the distances between each of the four towns, what is the shortest route which ensures that he visits each town once only and ends up at his starting point? Figure 20.1. shows the distances between the towns.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1987 E. J. Redfern
About this chapter
Cite this chapter
Redfern, E.J. (1987). Trees and Graphs. In: Introduction to Pascal for Computational Mathematics. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-18977-9_20
Download citation
DOI: https://doi.org/10.1007/978-1-349-18977-9_20
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-44431-3
Online ISBN: 978-1-349-18977-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)