最短路径迪杰斯特拉算法，是我们课程设计的作业-The shortest path Dijkstra algorithm, our curriculum design jobs

这是一个最简单的四位的全加器设计，由两个半加器构成，采用的是VERILOG的算法级和门级描述的。-This is one of the easiest of the four full adder design, consists of two half-adder, the VERILOG algorithm-level and gate-level descr iptions.

算法设计课程全部代码，包括0-1背包问题，回溯方法解n皇后问题，最大字段和，归并排序等算法，并全部包含人机交互过程-Algorithm design courses all the code, including the 0-1 knapsack problem, backtracking method to solve n-queens problem, the maximum field and, merge sort algorithms, and all include human-co