本节书摘来自异步社区《Python算法教程》一书中的第1章，第1.8节，作者[挪威]Magnus Lie Hetland（赫特兰）， 凌杰 译，更多章节内容可以访问云栖社区“异步社区”公众号查看。

1.8 参考资料

• Applegate, D., Bixby, R., Chvátal, V., Cook, W., and Helsgaun, K. Optimal tour of Sweden. www.math.uwaterloo.ca/tsp/sweden/. Accessed April 6,2014.

• Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2009). Introduction to Algorithms, second edition. MIT Press.
• Dasgupta, S., Papadimitriou, C., and Vazirani, U. (2006). Algorithms. McGraw-Hill.
• Goodrich, M. T. and Tamassia, R. (2001). Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, Ltd.
• Hetland, M. L. (2008). Beginning Python: From Novice to Professional, second edition. Apress.
• Kleinberg, J. and Tardos, E. (2005). Algorithm Design. Addison-Wesley Longman Publishing Co., Inc.
• Knuth, D. E. (1968). Fundamental Algorithms, volume 1 of The Art of Computer Programming. AddisonWesley.
• ———. (1969). Seminumerical Algorithms, volume 2 of The Art of Computer Programming. AddisonWesley.
• ———. (1973). Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley.
• ———. (2011). Combinatorial Algorithm, Part 1, volume 4A of The Art of Computer Programming. Addison-Wesley.
• Miller, B. N. and Ranum, D. L. (2005). Problem Solving With Algorithms and Data Structures Using Python. Franklin Beedle & Associates.