拓扑排序------打印输出计算机本科专业4年每学期的课表 1.采用C++实现。 2.熟练掌握图的应用。 3.熟练掌握图的邻接表存储结构以及拓扑排序的基本思想。 4.上机调试程序,掌握查错、排错使程序能正确运行。 5.算法提示：拓扑排序用队列存储入度为零的顶点-Computer printout of topological sorting------ 4-year undergraduate curriculum of each semester 1. Using C++

生成N阶幻方的所有形式。这个例子N等于3.可以用查找替换修改幻方阶数。输出用最简单的打印输出。-Magic square of order N generated all the forms. This case N = 3 can be modified using find and replace magic square of order. Output with a simple printout.

// You are given a binary tree in which each node contains a value. Design a lgorithm to print all paths which sum up to that value. Note that it can be any path in the tree - it does not have to start at the root. // 给定一棵二叉树，每个结点包含一个值。打印出所有满足以下