[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fQBIuv_kGLCHssjrSKhLEMlfhEJMYTuowcQAIsPVZ4gw":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-12-09 12:23:30",257065692,[8,9,10,11],"先进先出","后进先出","结点的优先级","随机",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},5,"b00e488459413a37d17e56e4a9a9d90b","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9c1e48361b00f3ee2086f4e259ed792b.jpg","算法分析与设计","work_48519094","数分作业4-4","优先队列式分支限界法选取扩展结点的原则是( )",[21,32,35,44,53],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],257065691,[25,26,27,28],"求解目标不同,搜索方式相同","求解目标不同,搜索方式也不同","求解目标相同,搜索方式不同","求解目标相同,搜索方式也相同","分支限界法与回溯法都是在问题的解空间树上搜索问题的解,二者( )","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":30,"type":31},[],257065694,[39,40,41,42],"广度优先","最小耗费优先","最大效益优先","深度优先","下面不是分支界限法搜索方式的是( )",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],257065695,[48,49,50,51],"回溯法","分支限界法","回溯法和分支限界法","动态规划法","在对问题的解空间树进行搜索的方法中,一个活结点最多有一次机会成为扩展结点的是( )",{"answer":54,"createTime":55,"id":56,"options":57,"question":58,"source":30,"type":59},[],"2025-12-11 16:21:11",260164092,[],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2e7fc286df7083ea2d1736962e5d2496.png\"> \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e504a51f09f79038783fbb7ea7013ad.png\">",4]