文件名称:dsatbx
介绍说明－－下载内容均来自于网络，请自行研究使用
matlab数据结构 算法工具箱, 包括堆栈 队列 2叉树 红黑树 -Data Structures & Algorithms Toolbox
====================================
The Data Structures & Algorithms Toolbox provides advanced data
structures and algorithms for the Matlab(r) 5 environment. It implements
functions to create and destroy singly and doubly linked list, stack,
queue, binary tree and red-black (balanced) binary tree. Data elements
can be inserted, deleted or searched for. A graphical representation of
trees can be shown. All algorithms are clearly written as m-files, which
allows the toolbox to be used as a teaching aid in educational data
structures courses. This is the first implementation available of
advanced datatypes, common in other languages, for Matlab.
====================================
The Data Structures & Algorithms Toolbox provides advanced data
structures and algorithms for the Matlab(r) 5 environment. It implements
functions to create and destroy singly and doubly linked list, stack,
queue, binary tree and red-black (balanced) binary tree. Data elements
can be inserted, deleted or searched for. A graphical representation of
trees can be shown. All algorithms are clearly written as m-files, which
allows the toolbox to be used as a teaching aid in educational data
structures courses. This is the first implementation available of
advanced datatypes, common in other languages, for Matlab.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
dsatbx\@POINTER\mt_ref1.dll
......\........\ne.dll
......\........\subsref.m
......\........\pointer.dll
......\........\mt_asgn1.dll
......\........\free.dll
......\........\eq.dll
......\........\subsasgn.m
......\@POINTER
......\random
......\readme.txt
......\bt_demo.m
......\bt_find.m
......\bt_grap2.m
......\dl_disp.m
......\dl_free.m
......\dl_trav.m
......\qu_enqu.m
......\rb_free.m
......\rb_new.m
......\rb_preor.m
......\rb_rr.m
......\st_empty.m
......\st_push.m
......\bt_graph.m
......\bt_preor.m
......\dl_puta.m
......\mt_asgn2.m
......\qu_free.m
......\qu_new.m
......\rb_inord.m
......\sl_appnd.m
......\sl_del.m
......\sl_disp.m
......\sl_get.m
......\sl_puta.m
......\bt_inord.m
......\dl_del.m
......\sl_new.m
......\st_new.m
......\contents.m
......\rb_demo.m
......\bt_del.m
......\bt_free.m
......\bt_put.m
......\dl_empty.m
......\dl_get.m
......\qu_dequ.m
......\rb_find.m
......\rb_graph.m
......\rb_posto.m
......\rb_put.m
......\sl_empty.m
......\st_pop.m
......\st_top.m
......\bt_posto.m
......\dl_new.m
......\malloc.m
......\mt_ref2.m
......\qu_front.m
......\rb_del.m
......\rb_rl.m
......\sl_count.m
......\sl_demo.m
......\sl_free.m
......\sl_insrt.m
......\st_free.m
......\bt_new.m
......\qu_empty.m
......\sl_trav.m
......\sorted
dsatbx
......\........\ne.dll
......\........\subsref.m
......\........\pointer.dll
......\........\mt_asgn1.dll
......\........\free.dll
......\........\eq.dll
......\........\subsasgn.m
......\@POINTER
......\random
......\readme.txt
......\bt_demo.m
......\bt_find.m
......\bt_grap2.m
......\dl_disp.m
......\dl_free.m
......\dl_trav.m
......\qu_enqu.m
......\rb_free.m
......\rb_new.m
......\rb_preor.m
......\rb_rr.m
......\st_empty.m
......\st_push.m
......\bt_graph.m
......\bt_preor.m
......\dl_puta.m
......\mt_asgn2.m
......\qu_free.m
......\qu_new.m
......\rb_inord.m
......\sl_appnd.m
......\sl_del.m
......\sl_disp.m
......\sl_get.m
......\sl_puta.m
......\bt_inord.m
......\dl_del.m
......\sl_new.m
......\st_new.m
......\contents.m
......\rb_demo.m
......\bt_del.m
......\bt_free.m
......\bt_put.m
......\dl_empty.m
......\dl_get.m
......\qu_dequ.m
......\rb_find.m
......\rb_graph.m
......\rb_posto.m
......\rb_put.m
......\sl_empty.m
......\st_pop.m
......\st_top.m
......\bt_posto.m
......\dl_new.m
......\malloc.m
......\mt_ref2.m
......\qu_front.m
......\rb_del.m
......\rb_rl.m
......\sl_count.m
......\sl_demo.m
......\sl_free.m
......\sl_insrt.m
......\st_free.m
......\bt_new.m
......\qu_empty.m
......\sl_trav.m
......\sorted
dsatbx