[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fRQyJkKgK2u4rYCPPr4gGL17zeJTdZnZlEau1yyQEiLE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-06-26 15:02:41",150819450,[8,9,10,11],"连通图G的生成树一定是唯一的","连通图G的生成树可以是不连通的","连通图G的生成树一定是连通而不包含回路的","连通图G的生成树中可以包含回路",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},66,"cea6f73a2a1b83479809e0d6016980ab","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F32b2d3425c6f9ff7313d63551492da64.png","数据结构","work_35476994","作业六:图","以下说法正确的是( )",[21,33,42,51,61,70,79,82,91,100],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-06-26 15:02:42",150819444,[26,27,28,29],"90","45","100","10","具有10个顶点的有向图,边的总数最多为( )","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],150819445,[37,38,39,40],"图为有向图","图中有偶数个结点","图中有奇数个结点","图为无向图","若邻接表中有奇数个边结点,则一定是( )",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],150819446,[46,47,48,49],"连通的","不连通的","无环的","有环的","一个有n个顶点和n条边的无向图一定是 ( )",{"answer":52,"createTime":53,"id":54,"options":55,"question":60,"source":31,"type":32},[],"2024-06-12 20:04:37",150819447,[56,57,58,59],"6","7","8","9","G是一个非连通无向图,共有28条边,则该图至少有( )个顶点",{"answer":62,"createTime":23,"id":63,"options":64,"question":69,"source":31,"type":32},[],150819448,[65,66,67,68],"连通网的极小连通子图","由连通网所得到的顶点数相对较少的生成树","连通网中所有生成树中权值之和为最小的生成树","由连通网所得到的边数最少的生成树","最小生成树指的是( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":31,"type":32},[],150819449,[74,75,76,77],"广度优先生成树","最小生成树","深度优先生成树","生成树","在一个带权连通图G中,权值最小的边一定包含在G的( )中",{"answer":80,"createTime":5,"id":6,"options":81,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":83,"createTime":5,"id":84,"options":85,"question":90,"source":31,"type":32},[],150819451,[86,87,88,89],"aebdcf","acfdeb","aedfcb","abedfc","无向图G=(V, E),其中V={a,b,c,d,e,f},E={(a,b),(a,e),(a,c),(b,e),(c,f),(f,d),(e,d)}.对该图进行深度优先遍历,下面不能得到的序列是( )",{"answer":92,"createTime":23,"id":93,"options":94,"question":99,"source":31,"type":32},[],150819452,[95,96,97,98],"O(ne)","O(n)","O(n+e)","O(e)","对有n个结点、e条边且使用邻接表存储的有向图进行广度优先遍历,其算法时间复杂度是( )",{"answer":101,"createTime":5,"id":102,"options":103,"question":108,"source":31,"type":32},[],150819453,[104,105,106,107],"I和III","I和II","只有II","只有I","下列关于无向连通图特性的叙述中,正确的是( ).I. 所有顶点的度之和为偶数II. 边数大于顶点个数减1III. 至少有一个顶点的度为1"]