6: Graph Theory Last updated Save as PDF Page ID 34211 David Lippman Pierce College via The OpenTextBookStore 6.1: Introduction 6.2: Graphs 6.3: Shortest Path Our goal in this chapter is to develop methods to solve complex problems in a systematic way by following algorithms. An algorithm is a step-by-step procedure for solving a problem. 6.4: Euler Circuits and the Chinese Postman Problem 6.5: Eulerization and the Chinese Postman Problem 6.6: Hamiltonian Circuits and the Traveling Salesman Problem 6.7: Spanning Trees 6.8: Exercise