+{"27835863": [{"id": "163657918", "title": "1. (单选题)在一个无向图G中，所有顶点的度数之和等于所有边数之和的（ ）倍。", "type": "单选题", "answer": "C", "option": ["A.l/2", "B.1", "C.2", "D.4"]}, {"id": "163657961", "title": "2. (单选题)一个具有n个顶点的无向联通图至少包含（ ）条边。", "type": "单选题", "answer": "C", "option": ["A.n", "B.n+1", "C.n-1", "D.n/2"]}, {"id": "163657966", "title": "3. (单选题)对于一个具有n个顶点和e条边的无向图，若采用邻接表表示，则所有顶点邻接表中的结点总数为（ ）。", "type": "单选题", "answer": "D", "option": ["A.n", "B.e", "C.2n", "D.2e"]}, {"id": "163657970", "title": "4. (单选题)在有向图的邻接表中，每个顶点邻接链表链接着该顶点所有（ ）邻接点。", "type": "单选题", "answer": "B", "option": ["A.入边", "B.出边", "C.入边和出边", "D.不是入边也不是出边"]}, {"id": "163657973", "title": "5. (单选题)在有向图的逆邻接表中，每个顶点邻接链表链接着该顶点所有（ ）邻接点。", "type": "单选题", "answer": "A", "option": ["A.入边", "B.出边", "C.入边和出边", "D.不是人边也不是出边"]}, {"id": "163657982", "title": "6. (单选题)邻接表是图的一种（ ）。", "type": "单选题", "answer": "B", "option": ["A.顺序存储结构", "B.链式存储结构", "C.索引存储结构", "D.散列存储结构"]}, {"id": "163657992", "title": "7. (单选题)无向图的邻接矩阵是一个（ ）。", "type": "单选题", "answer": "A", "option": ["A.对称矩阵", "B.零矩阵", "C.上三角矩阵", "D.对角矩阵"]}, {"id": "163658067", "title": "8. (单选题)下列有关图遍历的说法不正确的是（ ）。", "type": "单选题", "answer": "C", "option": ["A.连通图的深度优先搜索是一个递归过程", "B.图的广度优先搜索中邻接点的寻找具有“先进先出”的特征", "C.非连通图不能用深度优先搜索法", "D.图的遍历要求每一顶点仅被访问一次"]}, {"id": "163658076", "title": "9. (单选题)采用邻接表存储的图的宽度优先遍历算法类似于二叉树的（ ） 。", "type": "单选题", "answer": "D", "option": ["A.先序遍历", "B.中序遍历", "C.后序遍历", "D.按层遍历"]}, {"id": "163658127", "title": "10. (单选题)判定一个有向图是否存在回路除了可以利用拓扑排序方法外,还可以利用（ ）。", "type": "单选题", "answer": "D", "option": ["A.求关键路径的方法", "B.求最短路径的Dijkstm方法", "C.宽度优先遍历算法", "D.深度优先遍历算法"]}, {"id": "163658719", "title": "11. (填空题)在图中，任何两个数据元素之间都可能存在关系，因此图的数据元素之间是一种________________的关系。", "type": "填空题", "answer": ["(1)多对多"], "option": []}, {"id": "163658725", "title": "12. (填空题)如果图中的边或弧带有权，则称这种图为_______________。", "type": "填空题", "answer": ["(1)网"], "option": []}, {"id": "163658736", "title": "13. (填空题)若一条路径上的开始结点和结束结点为同一个顶点，则称该路径为________或_______。同时除了第一个顶点和最后一个顶点之外，其余顶点不重复出现的回路称_________或__________。", "type": "填空题", "answer": ["(1)回路", "(2)环", "(3)简单回路", "(4)简单环"], "option": []}, {"id": "163659901", "title": "14. (填空题)邻接表(Adjacency List)是图的一种_______存储结构。在邻接表中，对图中每个顶点建立一个_________，第i个单链表中的结点表示依附于顶点vi的边(对无向图)或弧（对有向图）。", "type": "填空题", "answer": ["(1)链式", "(2)单链表"], "option": []}, {"id": "163659921", "title": "15. (填空题)构造一棵最小生成树往往都要利用最小生成树的一种简称为MST的性质。常见的构造最小生成树的______________算法和___________算法都利用了MST性质。", "type": "填空题", "answer": ["(1)普里姆（Prim）", "(2)克鲁斯卡尔（Kruskal）"], "option": []}, {"id": "163658608", "title": "16. (判断题)有n个结点的无向图中，若边数大于n-1，则该图是连通的。（ ）", "type": "判断题", "answer": "错", "option": []}, {"id": "163658611", "title": "17. (判断题)AOV网拓扑排序的结果是惟一的。（ ）", "type": "判断题", "answer": "错", "option": []}, {"id": "163658616", "title": "18. (判断题)图的广度优先搜索序列是惟一的。（ ）", "type": "判断题", "answer": "错", "option": []}, {"id": "163658618", "title": "19. (判断题)若一个有向图的邻接矩阵中对角线以下元素均为零，则该图的拓扑有序序列必定存。（ ）", "type": "判断题", "answer": "对", "option": []}, {"id": "163658632", "title": "20. (判断题)具有n个顶点的无向图采用邻接矩阵表示，图中的边数等于邻接矩阵中非零元素之和的一半。（ ）", "type": "判断题", "answer": "对", "option": []}, {"id": "163658636", "title": "21. (判断题)若连通图上各边权值均不相同，则该图的最小生成树是惟一的。（ ）", "type": "判断题", "answer": "对", "option": []}, {"id": "163658641", "title": "22. (判断题)无向图的邻接矩阵一定是对称的。（ ）", "type": "判断题", "answer": "对", "option": []}, {"id": "163658643", "title": "23. (判断题)有向图的邻接矩阵一定是非对称的。（ ）", "type": "判断题", "answer": "错", "option": []}, {"id": "163658645", "title": "24. (判断题)图G的某一最小生成树的代价一定小于其他生成树的代价。（ ）", "type": "判断题", "answer": "错", "option": []}, {"id": "163658661", "title": "25. (判断题)对任意一个图从它的某个顶点出发进行一次深度优先或广度优先搜索遍历可访问到该图的每个顶点。（ ）", "type": "判断题", "answer": "错", "option": []}], "info": {"work_id": "1", "id": "27835863", "work_name": "第7章 图-作业", "work_status": "已完成", "work_url": "https://mooc1.chaoxing.com/mooc2/work/task?courseId=204924252&classId=73792554&cpi=269513956&workId=27835863&answerId=51875280&enc=3b8e82deed331864daac4e8af6e9f3b5", "course_name": "数据结构与算法"}}
0 commit comments