[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fGkZaBGhRUtXBUkzo-ZrtcpEoA6_YOEd86Q0-yt4mUJY":3},{"id":4,"source":5,"question":6,"options":7,"answer":8,"related":9,"type":39,"origin":78,"createTime":46},184096739,"v1","子图必须包含原图的所有边",[],[],[10,23,33,40,47,53,57,68],{"id":11,"source":5,"question":12,"options":13,"answer":18,"related":19,"type":20,"origin":21,"createTime":22},184096688,"顶点度数为奇数的顶点个数在图中满足",[14,15,16,17],"至少为1","至少为2","必须为偶数","必须为奇数",[],[],0,null,"2025-04-22T13:06:12+08:00",{"id":24,"source":5,"question":25,"options":26,"answer":31,"related":32,"type":20,"origin":21,"createTime":22},184096694,"以下哪项是图论中\"圈\"的定义",[27,28,29,30],"顶点集合中任意两点均有路径","顶点通过路径首尾相连形成闭合回路","无环且无平行边的图","顶点度数均为奇数的图",[],[],{"id":34,"source":5,"question":35,"options":36,"answer":37,"related":38,"type":39,"origin":21,"createTime":22},184096711,"无孤立点的图一定是连通图",[],[],[],3,{"id":41,"source":5,"question":42,"options":43,"answer":44,"related":45,"type":39,"origin":21,"createTime":46},184096725,"图中所有顶点的度数之和等于边数的两倍",[],[],[],"2025-04-22T13:06:13+08:00",{"id":48,"source":5,"question":49,"options":50,"answer":51,"related":52,"type":39,"origin":21,"createTime":46},184096734,"若图中任意两个顶点之间都存在路径,则该图是连通图",[],[],[],{"id":4,"source":5,"question":6,"options":54,"answer":55,"related":56,"type":39,"origin":21,"createTime":46},[],[],[],{"id":58,"source":5,"question":59,"options":60,"answer":65,"related":66,"type":67,"origin":21,"createTime":46},184096749,"关于图论中的顶点度数,下列说法正确的有( )",[61,62,63,64],"无向图中所有顶点度数之和等于边数的2倍","有向图中所有顶点的入度之和等于出度之和","度数为奇数的顶点个数必为偶数","孤立点的度数为0",[],[],1,{"id":69,"source":5,"question":70,"options":71,"answer":76,"related":77,"type":67,"origin":21,"createTime":46},184096754,"下列属于图论应用领域的有( )",[72,73,74,75],"通信网络布局","交通路线规划","项目管理中的关键路径分析","搜索引擎的网页排名算法",[],[],{"courseName":79,"courseImg":80,"workName":81,"workId":82,"count":83,"courseId":84},"运筹学原理C","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8b76f899eb3db9aa317e1c569e0e9c54.png","课前测—图论第一次课","work_42547935",8,"18055d0a0f7ae330248245ad672a5b02"]