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