Contents iⅸ Exercises 277 Bibliographic Notes and Further Reading 279 10 Graph Traversals and Algorithms 281 10.1 Depth First Search 281 10.2 Breadth First Search 283 10.3 Detection of Cycles 285 10.4 Topological Ordering 287 10.5 Connectedness of Graphs 290 Exercises 292 Bibliographic Notes and Further Reading 293 11 String-searching Algorithms 295 11.1 Definitions 295 11.2 Data Structures for Strings 296 11.3 String-searching Algorithms 297 11.4 String-searching in Large Static Strings 307 Exercises 310 Bibliographic Notes and Further Reading 311 12 Hard'Problems and NP-completeness 313 12.1 NP-problems and NP-complete Problems 315 12.2 Methods for Solving 'Hard'Problems 318 Exercises 329 Bibliographic Notes and Further Reading 332 Solutions to Selected Exercises 335 Index 373