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