Algorithms illuminated. Part 2. Graph algorithms

✍ Scribed by Roughgarden T

Publisher: Soundlikeyourself
Year: 2018
Tongue: English
Leaves: 221
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Preface......Page 7
Some Vocabulary......Page 13
A Few Applications......Page 14
Measuring the Size of a Graph......Page 15
Representing a Graph......Page 19
Problems......Page 25
Overview......Page 27
Breadth-First Search and Shortest Paths......Page 37
Computing Connected Components......Page 46
Depth-First Search......Page 52
Topological Sort......Page 57
Computing Strongly Connected Components......Page 66
The Structure of the Web......Page 78
Problems......Page 83
The Single-Source Shortest Path Problem......Page 88
Dijkstra's Algorithm......Page 92
Why Is Dijkstra's Algorithm Correct?......Page 95
Implementation and Running Time......Page 101
Problems......Page 103
Data Structures: An Overview......Page 107
Supported Operations......Page 110
Applications......Page 113
Speeding Up Dijkstra's Algorithm......Page 118
Implementation Details......Page 124
Problems......Page 135
Sorted Arrays......Page 138
Search Trees: Supported Operations......Page 141
Implementation Details......Page 143
Balanced Search Trees......Page 157
Problems......Page 161
Supported Operations......Page 163
Applications......Page 166
Implementation: High-Level Ideas......Page 171
Further Implementation Details......Page 185
Bloom Filters: The Basics......Page 190
Bloom Filters: Heuristic Analysis......Page 196
Problems......Page 202
The Gist......Page 205
Big-O Notation......Page 206
Examples......Page 207
Big-Omega and Big-Theta Notation......Page 209
Solutions to Selected Problems......Page 212
Index......Page 215

📜 SIMILAR VOLUMES

Algorithms Illuminated (Part 2): Graph A

📁 Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures

✍ Tim Roughgarden 📂 Library 📅 2018 🏛 Soundlikeyourself Publishing, LLC 🌐 English

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms I

Algorithms Illuminated (Part 2): Graph A

📁 Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures

✍ Tim Roughgarden 📂 Library 📅 2018 🏛 Soundlikeyourself Publishing, LLC 🌐 English

Algorithms illuminated Part 2 Graph Algo

📁 Algorithms illuminated Part 2 Graph Algorithms and Data Structures

✍ Tim Roughgarden 📂 Library 📅 2018 🏛 Soundlikeyourself 🌐 English

Algorithms in C++ Part 5: Graph Algorith

📁 Algorithms in C++ Part 5: Graph Algorithms

✍ Robert Sedgewick 📂 Library 📅 2002 🏛 Addison-Wesley Professional 🌐 English

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++

Algorithms in C, Part 5: Graph Algorithm

📁 Algorithms in C, Part 5: Graph Algorithms

✍ Sedgewick, Robert 📂 Library 📅 2001;2002 🏛 Addison-Wesley Professional 🌐 English

Graph algorithms are increasingly critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest book in Robert Sedgewick's classic series on algorithms focuses entirely on graph algorithms, introduci

Algorithms in C++ Part 5: Graph Algorith

📁 Algorithms in C++ Part 5: Graph Algorithms

✍ Sedgewick, Robert; Wyk, Christopher J. van 📂 Library 📅 2001 🏛 Addison-Wesley Professional 🌐 English

Providing exercises to help students learn the properties of algorithms, this text places a greater emphasis on abstract data types, modular programming, object-oriented programming and C++ classes.