[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fsb7jSNBDlOsEvvhqjcNhjcyrBMrrWnP_Hh59p95-fXM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":11,"question":18,"related":19,"source":29,"type":30},[],"2024-05-07 09:30:22",141807865,[8,9,10],"均相等","均互不相等","不一定相等",{"count":12,"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},10,"3c4c2480355d282f760d58de370bd1e9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","数据结构","work_34805436","2024年第11周第1次课课堂练习(最短路径)","当各边上的权值( )时,BFS算法可用来解决单源最短路径问题",[20,31,40,49,58,67,76,83,89,98],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],141807856,[24,25,26,27],"Dijkstra算法","Kruskal算法","深度优先搜索","拓扑排序算法","我们用一个有向图来表示航空公司所有航班的航线.下列哪种算法最适合解决找给定两城市间最经济的飞行路线问题","v1",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],141807857,[35,36,37,38],"关键路径","最短路径","拓扑排序","字符串匹配","数据结构中Dijkstra算法用来解决哪个问题",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":29,"type":30},[],141807858,[44,45,46,47],"ACFEDBG","ACDBFEG","ACDGFBE","ABCDEFG","试利用 Dijkstra 算法求下图中从顶点 A 到其他顶点的最短距离及对应的路径.下列那个序列给出了可能的顶点收集顺序? \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F316160020bf765fcf220e15b407f8cc8.JPG\">",{"answer":50,"createTime":5,"id":51,"options":52,"question":57,"source":29,"type":30},[],141807859,[53,54,55,56],"只能使用Floyd算法","只能使用Dijkstra算法","可以使用Dijkstra算法或Floyd算法","要同时使用Dijkstra算法和Floyd算法","求每一对顶点之间的最短路径,以下说法正确的是( )",{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":29,"type":30},[],141807860,[62,63,64,65],"最短路径一定是简单路径","Dijkstra算法不适合有回路的带权图求最短路径","Dijkstra算法不适合求任意两个顶点的最短路径","Floyd算法求两个顶点的最短路径时,pathk-1一定是pathk的子集","以下叙述正确的是( )",{"answer":68,"createTime":5,"id":69,"options":70,"question":75,"source":29,"type":30},[],141807861,[71,72,73,74],"O(n3)","O(n2)","O(n)","O(1)","设图中顶点总数为n,求解任意两个顶点之间的最短路径的Floyd算法的时间复杂度为( )",{"answer":77,"createTime":5,"id":78,"options":79,"question":82,"source":29,"type":30},[],141807862,[80,81,24,25],"Floyd算法","Prim算法","求从某个源点到其余各点的最短路径最合适采用的算法是( )",{"answer":84,"createTime":5,"id":85,"options":86,"question":88,"source":29,"type":30},[],141807863,[87,73,72,71],"O(log2n)","设图中顶点总数为n,则采用迪杰斯特拉(Dijkstra)算法求任意两点之间的最短路径的时间复杂度是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":29,"type":30},[],141807864,[93,94,95,96],"26、3、14、6","25、3、14、6","21、3、14、6","15、3、14、6","使用 Dijkstra 算法求下图中从顶点 1 到其余各顶点的最短路径,将当前找到的从顶点 1 到顶点 2、3、4、5 的最短路径长度保存在数组 dist 中,求出第二条最短路径后,dist 中的内容更新为: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F36d43afdfb74e6714a2329a62ce0f2c5.png\">",{"answer":99,"createTime":5,"id":6,"options":100,"question":18,"source":29,"type":30},[],[8,9,10]]