• Something wrong with this record ?

Algorithms in C. Part 5 : graph algorithms

Robert Sedgewick

Published
Boston : Addison-Wesley, 2002
Edition
3rd ed.
Pagination
482 s.

Language English Country United States

Links

Knihovny.cz ISBN 0-201-31663-3

(Pearson Education) Text providing a comprehensive introduction to important algorithms in C, concentrating on graph algorithms. Covers diagraphs and DAGs, shortest paths, minimum spanning trees, network flows, sample C code, and detailed algorithm descriptions. Previous edition not cited. Softcover. DLC: C (Computer program language).

Owner Details Services
Other libraries Details Services
ABE205 ABE205 Shelf no. K 4865/I-IV
000      
00915nam 2200301 a 4500
001      
MED00147122
003      
CZ-PrNML
005      
20141219161801.0
008      
040210s2002 xxu eng||
009      
BK
020    __
$a 0-201-31663-3
040    __
$a ABE205 $b cze $d ABA008 $e AACR2
041    0_
$a eng
044    __
$a xxu $c US
072    _7
$x Přírodní vědy. Matematické vědy $a 5 $2 konspekt $7 sk135991
080    __
$a 5 $2 h
100    1_
$a Sedgewick, Robert $4 aut $7 _gn020036632
245    10
$a Algorithms in C. $n Part 5 : $b graph algorithms / $c Robert Sedgewick
250    __
$a 3rd ed.
260    __
$a Boston : $b Addison-Wesley, $c 2002
300    __
$a 482 s.
650    07
$a přírodní vědy $2 mednas $7 nlk20040148348
653    0_
$a datová struktura
990    __
$a 20050212 $b ABA008
991    __
$a 20050527 $b ABA008
BAS    __
$a SKM $a 02 $a 26 $a 11