Graphs, Algorithms, and Optimization is a comprehensive book that features a clear explanation of modern graph theory in a rigorous yet approachable way. Suitable for use as a textbook in either mathematics or computer science courses, it is designed to present graph theory from an algorithmic point of view, allowing for a variety of technical applications. It includes useful programming techniques to solve graph theory problems, and applicable data structures to show how algorithms can be programmed. Additional coverage is provided on discrete optimization and its connection to graph theory, algorithmic complexity and efficiency, NP- completeness, and linear optimization.