[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$foUcbM71y9MtuBYrNhpSgYSs_3_Rc750cwqGbawYA75c":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":27,"type":82},[],"2024-12-02 20:34:40",168609080,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},27,"275e9e64f64491da611437cd86495060","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","算法设计与分析","work_38984651","第5章 回溯法","图的m着色问题:给定无向连通图G和m种不同的颜色.用这些颜色为图G的各顶点着色,每个顶点着一种颜色.如果有一种着色法使G中每条边的两个顶点着不同颜色,则称这个图是m可着色的.图的m着色问题是对于给定图G和m种颜色,找出所有不同的着色法. 用回溯法解该问题,构造的解空间树是()",[17,29,39,48,58,63,68,77,83,86],{"answer":18,"createTime":19,"id":20,"options":21,"question":26,"source":27,"type":28},[],"2024-12-03 21:48:37",168396581,[22,23,24,25],"广度优先","最小耗费优先","深度优先","活结点优先","回溯法在解空间树T上的搜索方式是( )","v1",0,{"answer":30,"createTime":31,"id":32,"options":33,"question":38,"source":27,"type":28},[],"2024-12-01 17:36:22",168396582,[34,35,36,37],"2n","2n+1-1","n","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff15ce6c5f8b341974762f2ffa0085c6a.png\">","对于含有n个物品的0-1背包问题,其解空间的叶结点数目为( )",{"answer":40,"createTime":19,"id":41,"options":42,"question":47,"source":27,"type":28},[],168396583,[43,44,45,46],"回溯法","动态规划法","回溯法和分支限界法","分支限界法","在对问题的解空间树进行搜索的方法中,一个活结点最多有一次机会成为活结点的是( )",{"answer":49,"createTime":50,"id":51,"options":52,"question":57,"source":27,"type":28},[],"2024-12-02 16:47:08",168396584,[53,54,55,56],"扩展结点","叶结点","活结点","死结点","在回溯法中,一个正在产生儿子的结点称为()",{"answer":59,"createTime":19,"id":60,"options":61,"question":62,"source":27,"type":28},[],168551640,[56,55,54,53],"一个自身已生成但其儿子还没有全部生成的节点称做()",{"answer":64,"createTime":50,"id":65,"options":66,"question":67,"source":27,"type":28},[],168551644,[36,37,35,34],"对于含有n个元素的排列树问题,其解空间的叶结点数目为( )",{"answer":69,"createTime":19,"id":70,"options":71,"question":76,"source":27,"type":28},[],168551648,[72,73,74,75],"广度优先生成树","子集树","深度优先生成树","排列树","回溯法解旅行售货员问题时的解空间树是( )",{"answer":78,"createTime":5,"id":79,"options":80,"question":81,"source":27,"type":82},[],168609079,[],"回溯法中的解空间树结构通常有两种,分别是 、",2,{"answer":84,"createTime":5,"id":6,"options":85,"question":15,"source":27,"type":82},[],[],{"answer":87,"createTime":5,"id":88,"options":89,"question":90,"source":27,"type":82},[],168609081,[],"0-1背包问题的回溯算法所需的计算时间为_____________,用动态规划算法所需的计算时间为____________"]