[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fImU6pYJ-p01SJ_sO68qLFnDsA45-LvJWZQKXokP0FrY":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":18,"origin":51,"createTime":20},8639155,"v1","下列说法正确的是",[8,9,10,11],"割集是子图","割量等于割集中弧的流量之和","割量大于等于最大流量","割量小于等于最大流量",[],[14,21,31,41],{"id":4,"source":5,"question":6,"options":15,"answer":16,"related":17,"type":18,"origin":19,"createTime":20},[8,9,10,11],[],[],0,null,"2023-05-13T10:41:44+08:00",{"id":22,"source":5,"question":23,"options":24,"answer":29,"related":30,"type":18,"origin":19,"createTime":20},8639156,"下列说法错误的是",[25,26,27,28],"容量不超过流量","流量非负","容量非负","发点流出的合流等于收点流入的合流",[],[],{"id":32,"source":5,"question":33,"options":34,"answer":39,"related":40,"type":18,"origin":19,"createTime":20},8639157,"求最大流的方法有",[35,36,37,38],"\"避圈法\"Kruskal算法","Ford—Fulkerson法","Dijkstra标号法","Warshall- Floyd算法",[],[],{"id":42,"source":5,"question":43,"options":44,"answer":49,"related":50,"type":18,"origin":19,"createTime":20},8639158,"甲乙两城市之间存在一公路网络,为了判断两小时内能否有9000辆车从甲城到乙城,应借助( )",[45,46,47,48],"树的生成法","求最大流法","求最小生成树法","求最短路法",[],[],{"courseName":52,"courseImg":53,"workName":54,"workId":55,"count":56,"courseId":57},"运筹学","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2b87dab74ecb0fd9a5cdced44382b976.jpg","第二十六讲 最大流问题","355e29100bdf4018bd031da105849a73",4,"90334fdcfb15192238bea6c86c86fe2b"]