000			02244nam a2200373 a 4500
003			BD-KhUET
005			20130502024209.0
008			110929r20011999maua 001 0 eng d
010			_a2002276304
020			_a0201361183
020			_a8178082497
040			_aDLC _cDLC _dDLC _dBD-KhUET
082	0	0	_a005.133 _221
100	1		_aSedgewick, Robert _93736
245	1	0	_aAlgorithms in C ++/ _cRobert Sedgewick.
250			_a3rd ed.
260			_aNew Delhi : _bAddison-Wesley, _cc1999.[Reprinted 2001]
300			_axvii, 716 p. : _bill. ; _c24 cm.
500			_a[1], pts. 1-4. Fundamentals, data structures, sorting, searching. [2], pt. 5. Graph algorithms.
500			_aIncludes index.
650		0	_aC++ (Computer program language) _9586
650		0	_aGraph algorithms. _93758
942			_2ddc _cBK
952			_p3010023925 _40 _eShowrov Book Center _00 _bKUETCL _10 _o005.133 SED _d2001-6-25 _t1 _70 _cGEN _2ddc _g553.50 Tk. _yBK _aKUETCL
952			_p3010023689 _40 _eShowrov Book Center _00 _bKUETCL _10 _o005.133 SED _d2001-06-25 _t2 _70 _cGEN _2ddc _g553.50 Tk. _yBK _aKUETCL
952			_p3010023926 _40 _eShowrov Book Center _00 _bKUETCL _10 _o005.133 SED _d2001-6-25 _t3 _70 _cGEN _2ddc _g553.50 Tk. _yBK _aKUETCL
952			_p3010023924 _40 _eShowrov Book Center _00 _bKUETCL _10 _o005.133 SED _d2001-6-25 _t4 _70 _cGEN _2ddc _g553.50 Tk. _yBK _aKUETCL
952			_p3010023687 _40 _eShowrov Book Center _00 _bKUETCL _10 _o005.133 SED _d2001-6-25 _t5 _70 _cGEN _2ddc _g553.50 Tk. _yBK _aKUETCL
999			_c461 _d461
952			_p3010023690 _40 _eSBC _00 _bKUETCL _10 _o005.133 SED _d2001-06-25 _t6 _70 _cGEN _2ddc _g553.50 Tk. _yBK _aKUETCL
952			_w2012-04-19 _p3010023922 _r2013-04-04 _40 _eM/S Shaurov Book Centre _00 _bKUETCL _m4 _10 _o005.133 SED _d2001-06-25 _q2013-06-01 _t7 _70 _cGEN _2ddc _g553.50 _yBK _s2013-04-04 _l3 _aKUETCL
952			_w2012-04-19 _p3010023923 _r2012-12-10 _40 _eM/S Shaurov Book Centre _00 _bKUETCL _m1 _10 _o005.133 SED _d2001-06-25 _t8 _70 _cGEN _2ddc _g553.50 _yBK _s2012-10-10 _l1 _aKUETCL