[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fHJfxa5ivSsPlww0YW6xQNZzyawVJvpgimOSZ_dVD9Xw":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":67,"origin":78,"createTime":50},184096749,"v1","关于图论中的顶点度数,下列说法正确的有( )",[8,9,10,11],"无向图中所有顶点度数之和等于边数的2倍","有向图中所有顶点的入度之和等于出度之和","度数为奇数的顶点个数必为偶数","孤立点的度数为0",[],[14,27,37,44,51,57,63,68],{"id":15,"source":5,"question":16,"options":17,"answer":22,"related":23,"type":24,"origin":25,"createTime":26},184096688,"顶点度数为奇数的顶点个数在图中满足",[18,19,20,21],"至少为1","至少为2","必须为偶数","必须为奇数",[],[],0,null,"2025-04-22T13:06:12+08:00",{"id":28,"source":5,"question":29,"options":30,"answer":35,"related":36,"type":24,"origin":25,"createTime":26},184096694,"以下哪项是图论中\"圈\"的定义",[31,32,33,34],"顶点集合中任意两点均有路径","顶点通过路径首尾相连形成闭合回路","无环且无平行边的图","顶点度数均为奇数的图",[],[],{"id":38,"source":5,"question":39,"options":40,"answer":41,"related":42,"type":43,"origin":25,"createTime":26},184096711,"无孤立点的图一定是连通图",[],[],[],3,{"id":45,"source":5,"question":46,"options":47,"answer":48,"related":49,"type":43,"origin":25,"createTime":50},184096725,"图中所有顶点的度数之和等于边数的两倍",[],[],[],"2025-04-22T13:06:13+08:00",{"id":52,"source":5,"question":53,"options":54,"answer":55,"related":56,"type":43,"origin":25,"createTime":50},184096734,"若图中任意两个顶点之间都存在路径,则该图是连通图",[],[],[],{"id":58,"source":5,"question":59,"options":60,"answer":61,"related":62,"type":43,"origin":25,"createTime":50},184096739,"子图必须包含原图的所有边",[],[],[],{"id":4,"source":5,"question":6,"options":64,"answer":65,"related":66,"type":67,"origin":25,"createTime":50},[8,9,10,11],[],[],1,{"id":69,"source":5,"question":70,"options":71,"answer":76,"related":77,"type":67,"origin":25,"createTime":50},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"]