数据结构与算法7.doc

第七次作业 一、选择题 1、设图有n个顶点和e条边，当用邻接矩阵表示该图时，则求解最短路径的Floyd算法的时间复杂度为 D 。 A. O(n) B. O(n+e) C. O(n2) D. O(n3) 2、分别以下列序列构造二叉排序数（二叉查找树），与用其他3个序列所构造的结果不同的是 C ： A. (100, 80, 90, 60, 120, 110, 130) B. (100, 120, 110, 130, 80, 60, 90) C. (100, 60, 80, 90, 120, 110, 130) D. (100, 80, 60, 90, 120, 130, 110) 3、在二叉平衡树中插入一个结点造成了不平衡，设最低的不平衡点为A，并已知A的左孩子的平衡因子为0，右孩子的平衡因子为1，则应作 C 型调整使其平衡。 A. LL B. LR C. RL D. RR 二、填空题 1、具有n个顶点的有向图，如果采用邻接矩阵表示该图，则求某顶点到其他各顶点的最短路径的Dijkstra算法的时间复杂度是 O(n^2) ；如果采用邻接表表示该图，则时间复杂度为 O(e) 。 2、在用Dijkstra算法求单源最短路径的过程中，将顶点集合V划分为两个集合S和V-S，其中S中的点为最短路径 已经确定的顶点集合 ，V-S中的点为 最短路径尚未确定的顶点集合 。 3、求每一对顶点之间的最短路径，可以用两种方法，一种是分别对每个顶点采用 Dijkstra 算法，另一种方法是 Floyd 。 4、假设有向图的邻接矩阵C的传递闭包为A，则A[i][j]=1表示 当且仅当有一条路径从i到j 。 5、有向图的中心点是指 具有最小偏心度的顶点 。 6、一个无序序列可以通过构造一棵 二叉排序序 Poj1125 Floyd算法 Stockbroker Grapevine Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the stock market. For maximum effect, you have to spread the rumours in the fastest possible way.?Unfortunately for you, stockbrokers only trust information coming from their Trusted sources This means you have to take into account the structure of their contacts when starting a rumour. It takes a certain amount of time for a specific stockbroker to pass the rumour on to each of his colleagues. Your task will be to write a program that tells you which stockbroker to choose as your starting point for the rumour, as well as the time it will take for the rumour to spread throughout the stockbroker community. This duration is measured as the time needed for the last person to receive the information. Input Your program will inp