[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fTrbb99gvjpvJML-ZzBUTIjOMBt0LZRhehi1pwHjrRJc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":13,"question":20,"related":21,"source":31,"type":78},[],"2026-05-21 22:19:23",381259839,[8,9,10,11,12],"旅行售货员问题归结为求总距离最小的Euler回路","旅行售货员问题可以建立一个0-1规划数学模型","旅行售货员问题归结为求总距离最小的Hamilton回路","旅行售货员问题是售货员遍历图的每条边","旅行售货员问题是售货员遍历图的每个点",{"count":14,"courseId":15,"courseImg":16,"courseName":17,"workId":18,"workName":19},9,"6a31920e99393c90528743d381bf9122","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe7735ea12bfce84426a0e5d933b730db.png","运筹学","work_53597440","网络模型测试题1","下列说法正确的是( )",[22,33,42,51,60,69,79,82,90],{"answer":23,"createTime":5,"id":24,"options":25,"question":30,"source":31,"type":32},[],381259833,[26,27,28,29],"最大流等于最大流量","调整量等于增广链上点标号的最大值","可行流是最大流当且仅当存在发点到收点的增广链","可行流是最大流当且仅当不存在发点到收点的增广链","下列正确的结论是( )","v1",0,{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":31,"type":32},[],381259834,[37,38,39,40],"Ford-Fulkerson算法","加边法","Floyd算法","Dijkstra算法","求最大流的计算方法有( )",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":31,"type":32},[],381259835,[46,47,48,49],"T有n个点n条边","T有n个点n-1条边","T有n-1个点n条边","T的长度等于G的每条边的长度之和","连通图G有n个点,其部分树是T,则有( )",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":31,"type":32},[],381259836,[55,56,57,58],"流量非负","容量不超过流量","容量非负","发点流出的合流等于流入收点的合流","下列错误的结论是( )",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":31,"type":32},[],381259837,[64,65,66,67],"6","8","5","7","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff45da74671e7d3b5a9e6b16530660e80.png\">",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":31,"type":78},[],381259838,[73,74,75,76],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fef84dbd252da3ef7818f8af6a82bd8cc.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1d6b6a94f2342c9fe3e8167b72d13670.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F52e1e3af2f2457322af1e2ba4988d7d7.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff23719f9be8c2418985f031acaac460e.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbeb0d6837bf14c3a838969bdc17aaf0f.png\">",1,{"answer":80,"createTime":5,"id":6,"options":81,"question":20,"source":31,"type":78},[],[8,9,10,11,12],{"answer":83,"createTime":5,"id":84,"options":85,"question":89,"source":31,"type":78},[],381259840,[86,87,38,88],"破圈法","避圈法","位势法","求最小支撑树的方法为( )",{"answer":91,"createTime":5,"id":92,"options":93,"question":94,"source":31,"type":78},[],381259841,[37,40,38,86,39],"求最短路的计算方法有( )"]