| 000 | 00901 a2200277 4500 | ||
|---|---|---|---|
| 003 | IIITD | ||
| 005 | 20250214020004.0 | ||
| 008 | 250211b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9780999282922 | ||
| 040 | _aIIITD | ||
| 082 |
_a005.73 _bROU-A |
||
| 100 | _aRoughgarden, Tim | ||
| 245 |
_aAlgorithms illuminated (part 2) : _bgraph algorithms and data structures _cby Tim Roughgarden |
||
| 260 |
_aSan Francisco : _bSoundlikeyourself Publishing, _c©2018 |
||
| 300 |
_axi, 209 p. : _bill. ; _c23 cm. |
||
| 500 | _aIncludes index | ||
| 505 | _t7. Graphs: The basic | ||
| 505 | _t8. Graph search and its applications | ||
| 505 | _t9. Dijkstra's shortest-path algorithm | ||
| 505 | _t10. The heap data structure | ||
| 505 | _t11. Search trees | ||
| 505 | _t12. Hash tables and bloom filters | ||
| 650 | _aComputer algorithms | ||
| 650 | _aComputer programming | ||
| 942 |
_cBK _2ddc _01 |
||
| 999 |
_c189838 _d189838 |
||