一些教科书上的算法源码，包括贪心算法，最小生成树算法，背包算法，图的宽度和深度检索等等。

算法\算法作业\深度优先遍历\深度优先遍历.cpp
....\........\............\深度优先遍历.dsp
....\........\............\深度优先遍历.dsw
....\........\............\深度优先遍历.jpg
....\........\............\深度优先遍历.ncb
....\........\............\深度优先遍历.opt
....\........\............\深度优先遍历.plg
....\........\找第k小元素\找第k大的数.jpg
....\........\...........\找第k小元素.cpp
....\........\...........\找第k小元素.dsp
....\........\...........\找第k小元素.dsw
....\........\...........\找第k小元素.ncb
....\........\...........\找第k小元素.opt
....\........\...........\找第k小元素.plg
....\........\快速排序\快速排序.cpp
....\........\........\快速排序.dsp
....\........\........\快速排序.dsw
....\........\........\快速排序.jpg
....\........\........\快速排序.ncb
....\........\........\快速排序.opt
....\........\........\快速排序.plg
....\........\广度优先遍历\广度优先遍历.cpp
....\........\............\广度优先遍历.dsp
....\........\............\广度优先遍历.dsw
....\........\............\广度优先遍历.jpg
....\........\............\广度优先遍历.ncb
....\........\............\广度优先遍历.opt
....\........\............\广度优先遍历.plg
....\........\多段图向前处理算法\复件 多段图算法.text
....\........\..................\多段图向前处理.jpg
....\........\..................\多段图向前处理算法2.cpp
....\........\..................\多段图向前处理算法2.dsp
....\........\..................\多段图向前处理算法2.dsw
....\........\..................\多段图向前处理算法2.ncb
....\........\..................\多段图向前处理算法2.opt
....\........\..................\多段图向前处理算法2.plg
....\........\图的着色\图的着色.cpp
....\........\........\图的着色.dsp
....\........\........\图的着色.dsw
....\........\........\图的着色.jpg
....\........\........\图的着色.ncb
....\........\........\图的着色.opt
....\........\........\图的着色.plg
....\........\哈密顿环\哈密顿环.cpp
....\........\........\哈密顿环.dsp
....\........\........\哈密顿环.dsw
....\........\........\哈密顿环.jpg
....\........\........\哈密顿环.ncb
....\........\........\哈密顿环.opt
....\........\........\哈密顿环.plg
....\........\双连通分图的判断\双连通分图.CPP
....\........\................\双连通分图.DSP
....\........\................\双连通分图.DSW
....\........\................\双连通分图.jpg
....\........\................\双连通分图.ncb
....\........\................\双连通分图.OPT
....\........\................\双连通分图.PLG
....\........\二分检索\二分检索.jpg
....\........\........\递归二分检索.cpp
....\........\........\递归二分检索.dsp
....\........\........\递归二分检索.ncb
....\........\........\递归二分检索.opt
....\........\........\递归二分检索.plg
....\........\prim算法\prim.cpp
....\........\........\prim.dsp
....\........\........\prim.dsw
....\........\........\prim.ncb
....\........\........\prim.opt
....\........\........\prim.plg
....\........\........\prim算法.jpg
....\........\n-皇后问题\n-皇后问题.cpp
....\........\..........\n-皇后问题.dsp
....\........\..........\n-皇后问题.dsw
....\........\..........\n-皇后问题.jpg
....\........\..........\n-皇后问题.ncb
....\........\..........\n-皇后问题.opt
....\........\..........\n-皇后问题.plg
....\........\LC分支限界\LC.CPP
....\........\..........\LC.DSP
....\........\..........\LC.DSW
....\........\..........\LC.jpg
....\........\..........\LC.ncb
....\........\..........\LC.OPT
....\........\..........\LC.PLG
....\........\Kruskal算法\Kruskal.cpp
....\........\...........\Kruskal.dsp
....\........\...........\Kruskal.dsw
....\........\...........\Kruskal.jpg
....\........\...........\Kruskal.ncb
....\........\...........\Kruskal.opt
....\........\...........\Kruskal.plg
....\........\greedy-js算法\greedy_js.cpp
....\........\.............\greedy_js.dsp
....\........\.............\greedy_js.dsw
....\........\.............\greedy_js.jpg
....\........\.............\greedy_js.ncb
....\........\.............\greedy_js.opt
....\........\.............\greedy_js.plg
....\........\.............\js.dsw
....\........\.............\js.opt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．