[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fMqKZ3-8w0nLUld75grU9XE8gI1X194G1_QMwOMiVs_s":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-01-06 22:26:25",176715449,[8,9,10,11],"e","2e","n²-e","n²-2e",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},29,"db6110eff8a4a080f4ae2e97491d5f07","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","数据结构 2024年秋","work_39980646","6-7选择题","在含有n个顶点和e条边的无向图的邻接矩阵中,零元素的个数为( )",[21,32,41,49,58,65,74,77,86,95],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],176715443,[25,26,27,28],"强连通图","连通图","有回路","一棵树","若从无向图的任意顶点出发进行一次深度优先搜索即可访问所有顶点,则该图一定是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],176715444,[36,37,38,39],"图与树的区别在于图的边数大于或等于顶点数","假设有图G={V,{E}}, 顶点集V'⊆V, E'⊆E, 则 V'和{E'}构成G的子图","无向图的连通分量是指无向图中的极大连通子图","图的遍历就是从图中某一顶点出发访遍图中其余顶点","以下关于图的叙述中,正确的是( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":40,"source":30,"type":31},[],176715445,[45,46,47,48],"强连通有向图的任何顶点到其他所有顶点都有弧","图的任意顶点的入度等于出度","有向完全图一定是强连通有向图","有向图的边集的子集和顶点集的子集都构成原有向图的子图",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":30,"type":31},[],176715446,[53,54,55,56],"n","n-1","2n","2n-2","在有n个顶点的有向图中,顶点的度最大可达( )",{"answer":59,"createTime":5,"id":60,"options":61,"question":64,"source":30,"type":31},[],176715447,[62,53,54,63],"n²","1","若具有n个顶点的图是一个环, 则它有( )棵生成树",{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":30,"type":31},[],176715448,[69,70,71,72],"1,2,1,2","2,2,1,1","3,4,2,3","4,4,2,2","设图的邻接矩阵A如下所示,各顶点的度依次是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fdd51d6f1f8a70608032e13b5347b4601.jpeg\">",{"answer":75,"createTime":5,"id":6,"options":76,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],176715450,[81,82,83,84],"第i行非∞的元素个数","第i列非∞的元素个数","第i行非∞且非0的元素个数","第i列非∞且非0的元素个数","带权有向图G用邻接矩阵存储,则 vᵢ的入度等于邻接矩阵中( )",{"answer":87,"createTime":5,"id":88,"options":89,"question":94,"source":30,"type":31},[],176715451,[90,91,92,93],"一个图的邻接矩阵表示唯一,邻接表表示唯一","一个图的邻接矩阵表示唯一, 邻接表表示不唯一","一个图的邻接矩阵表示不唯一, 邻接表表示唯一","一个图的邻接矩阵表示不唯一,邻接表表示不唯一","以下关于图的存储结构的叙述中,正确的是( )",{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":30,"type":31},[],176715452,[99,100,101,102],"无向图","有向图","无向图和有向图","都不是","十字链表是( )的存储结构"]