Algorithms illuminated (part 2) : graph algorithms and data structures
Publication details: San Francisco : Soundlikeyourself Publishing, ©2018Description: xi, 209 p. : ill. ; 23 cmISBN:- 9780999282922
- 005.73 ROU-A
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | Course reserves |
---|---|---|---|---|---|---|---|---|
![]() |
IIITD General Stacks | Computer Science and Engineering | 005.73 ROU-A (Browse shelf(Opens below)) | Checked out | 12/08/2025 | 013183 | ||
![]() |
IIITD Reference | Computer Science and Engineering | REF 005.73 ROU-A (Browse shelf(Opens below)) | Not for loan | 013184 |
Analysis and Design of Algorithms (Sec A & B) UG (SEM IV) WNT25 |
Browsing IIITD shelves, Shelving location: General Stacks, Collection: Computer Science and Engineering Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.73 LIP-D Schaum's outline of theory and problems of data structures | 005.73 NEC-D Data structures and algorithms using Python | 005.73 ROU-A Algorithms illuminated (part 1) : the basics | 005.73 ROU-A Algorithms illuminated (part 2) : graph algorithms and data structures | 005.73 ROU-A Algorithms illuminated (part 3) : greedy algorithms and dynamic programming | 005.73 SHA-D Data Structures using C | 005.73 SUL-D Data structures |
Includes index
7. Graphs: The basic
8. Graph search and its applications
9. Dijkstra's shortest-path algorithm
10. The heap data structure
11. Search trees
12. Hash tables and bloom filters
There are no comments on this title.