This Textbook Is A Concise Introduction To The Basic Toolbox Of Structures That Allow Efficient Organization And Retrieval Of Data, Key Algorithms For Problems On Graphs, And Generic Techniques For Modeling, Understanding, And Solving Algorithmic Problems. The Authors Aim For A Balance Between Simplicity And Efficiency, Between Theory And Practice, And Between Classical Results And The Forefront Of Research. Individual Chapters Cover Arrays And Linked Lists, Hash Tables And Associative Arrays, Sorting And Selection, Priority Queues, Sorted Sequences, Graph Representation, Graph Traversal, Shortest Paths, Minimum Spanning Trees, Optimization, Collective Communication And Computation, And Load Balancing.