大数据结构_实验六_报告材料.docxVIP

实用文案 实用文案 标准文档 标准文档 实验报告 实验六 图的应用及其实现 一、实验目的 ?进一步功固图常用的存储结构。 ?熟练掌握在图的邻接表实现图的基本操作。 3?理解掌握AOV网、AOE网在邻接表上的实现以及解决简单的应用问题。 二、实验内容 一.基础题目：(本类题目属于验证性的，要求学生独立完成 ) ［题目一］:从键盘上输入AOV网的顶点和有向边的信息，建立其邻接表存储结构, 然后对该图拓扑排序，并输出拓扑序列?试设计程序实现上述 AOV网 的类型定义和基本操作，完成上述功能。 ［题目二］:从键盘上输入AOE网的顶点和有向边的信息，建立其邻接表存储结构, 输出其关键路径和关键路径长度。试设计程序实现上述AOE网类型定义和基本 操作，完成上述功能。 测试数据：教材图7.29 ［题目五】连通OR不连通 描述：给定一个无向图，一共n个点，请编写一个程序实现两种操作： D x y从原图中删除连接x, y节点的边。 Q x y询问x, y节点是否连通 输入 第一行两个数 n,m (5=nv=40000,1v=m=100000 ) 接下来m行，每行一对整数x y (x,y=n )，表示x,y之间有边相连。保证没 有重复的边。 接下来一行一个整数 q (q=100000 ) 以下q行每行一种操作，保证不会有非法删除。 输出 按询问次序输出所有Q操作的回答，连通的回答 C,不连通的回答D 样例输入 3 2 3 3 5 Q 1 2 D 1 2 Q 1 2 D 3 2 Q 1 2 样例输出 C C D 【题目六】 Sort Problem An asce nding sorted seque nee of disti net values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted seque nee A, B, C, D implies that A B, B C and C D. in this problem, we will give you a set of relations of the form A B and ask you to determ ine whether a sorted order has bee n specified or not. 【Input ] In put con sists of multiple problem in sta nces. Each in sta nee starts with a line containing two positive integers n and m . the first value indicated the number of objects to sort, where 2 = n = 26. The objects to be sorted will be the first n characters of the uppercase alphabet. The sec ond value m in dicates the nu mber of relati ons of the form A B which will be give n in this problem in sta nee. 1 = m = 100. Next will be m lin es, each containing one such relati on con sist ing of three characters: an uppercase letter, the character and a second uppercase letter. No letter will be outside the range of the first n letters of the alphabet. Values of n = m = 0 in dicate end of in put. [Output ] For each problem in sta nee, output con sists of one line. This line should be one of the follow ing three: Sorted seque nee determ in ed: y y y … y. Sorted seque nee cannot be determ in ed. Incon siste ncy found. y y y