[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fHCVc8k9H8SZe1RAzeM6r9gQPALWhci_bk9qrR9TyrgE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":23,"type":24},[],"2023-05-10 03:01:16",88978705,[8,9,10,11],"n","n-1","m-n-1","m-n+1",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000063122","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3556e68aca20d907d8778d02515aa8c4.png","离散数学（下）","35657985","离散数学（下）教程考试","n阶m条边的无向连通图G,则其生成树T的弦的条数为",[20,25,34,42,52,61,70,79],{"answer":21,"createTime":5,"id":6,"options":22,"question":18,"source":23,"type":24},[],[8,9,10,11],"v2",0,{"answer":26,"createTime":5,"id":27,"options":28,"question":33,"source":23,"type":24},[],88978717,[29,30,31,32],"1","2","3","5","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F349032e0ba21924c4fedfc0a327d74d4.PNG\">",{"answer":35,"createTime":5,"id":36,"options":37,"question":40,"source":23,"type":41},[],88978740,[38,39],"对","错","欧拉图一定是强连通图",3,{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":23,"type":51},[],88978760,[46,47,48,49],"a","b","c","d","设<G, *>是循环群,G={a,b,c,d},"*"运算定义如下,则群的生成元是*abcdaabcdbbcdaccdabddabc",1,{"answer":53,"createTime":5,"id":54,"options":55,"question":60,"source":23,"type":24},[],88978761,[56,57,58,59],"半群可以有无穷多个右单位元","半群一定有一个右单位元","半群如果有右单位元则一定有左单位元","半群一定至少有一个左单位元","关于半群,下列说法正确的是",{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":23,"type":24},[],88978766,[65,66,67,68],"不能构成群","不一定能构成群","必能构成群","能构成交换群","任意具有多个等幂元的半群,下列说法正确的是",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":23,"type":24},[],88978791,[74,75,76,77],"半群","独异点","群","交换群","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F63552fcfe39b3e305b6caa243aee3999.PNG\">",{"answer":80,"createTime":5,"id":81,"options":82,"question":83,"source":23,"type":41},[],88978819,[38,39],"哈夫曼算法可用来求解最优二叉树,且最优树唯一"]