[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fH1_L4YpA5Ro0N-_ok0zogaw0QNLUQWaednAx02pNAQk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":13,"question":17,"related":18,"source":28,"type":107},[],"2025-12-24 09:59:47",283991904,[8,9,10,11,12],"Floyd 算法的时间复杂度为 \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff0dfdb4729644a5fd225dedc9c4d5ca2.png\">","Floyd 算法可以处理带负权边的图","Floyd 算法不能检测图中是否存在负权环","Floyd 算法用于求所有点对之间的最短路径","Floyd 算法适合边数较少的图",{"courseId":14,"courseImg":15,"courseName":16},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","关于 Floyd 算法,下列说法正确的有",[19,30,39,48,57,66,75,82,91,98],{"answer":20,"createTime":5,"id":21,"options":22,"question":27,"source":28,"type":29},[],283991890,[23,24,25,26],"邻接表中每个顶点对应的链表长度相同","邻接表不适合用于无向图","邻接表适合表示稀疏图","邻接表的空间复杂度为O(n²)","下列关于图的邻接表存储方式的说法中,哪一项是正确的","v1",0,{"answer":31,"createTime":5,"id":32,"options":33,"question":38,"source":28,"type":29},[],283991891,[34,35,36,37],"无向图","有权图","完全图","有向无环图(DAG)","拓扑排序适用于哪种类型的图",{"answer":40,"createTime":5,"id":41,"options":42,"question":47,"source":28,"type":29},[],283991892,[43,44,45,46],"图的边数远少于顶点数的平方(稀疏图)","图结构需要频繁进行边的插入或删除操作","需要频繁判断两个顶点之间是否存在边","需要对图进行广度优先遍历","在以下哪种场景下,使用邻接矩阵存储图比邻接表更为高效",{"answer":49,"createTime":5,"id":50,"options":51,"question":56,"source":28,"type":29},[],283991893,[52,53,54,55],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F859c2a4ff6beba7493a41b253c9c836c.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5769fbdb97e53eb66dbb96a49093b833.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcb3468b03a09fadcd2b85c422d87c7c4.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F887e8a887713acbf48aa77c711d2a1d3.png\">","在图的邻接表表示中,查找某顶点的所有邻接点的时间复杂度是",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":28,"type":29},[],283991894,[61,62,63,64],"最小生成树问题","拓扑排序问题","单源最短路径问题","全源最短路径问题","Dijkstra算法主要用于解决哪种问题",{"answer":67,"createTime":5,"id":68,"options":69,"question":74,"source":28,"type":29},[],283991895,[70,71,72,73],"当前权值最大的边","任意一条边","当前权值最小的边,且不会形成环","连接两个已访问顶点的边","Kruskal算法在每一步中选择的是",{"answer":76,"createTime":5,"id":77,"options":78,"question":81,"source":28,"type":29},[],283991896,[61,62,79,80],"最大流问题","最短路径问题","Prim算法适用于求解哪种问题",{"answer":83,"createTime":5,"id":84,"options":85,"question":90,"source":28,"type":29},[],283991897,[86,87,88,89],"哈希表","队列","二叉树","栈","在图的深度优先搜索(DFS)中,通常使用哪种数据结构来实现",{"answer":92,"createTime":5,"id":93,"options":94,"question":97,"source":28,"type":29},[],283991898,[95,87,89,96],"堆","链表","广度优先搜索(BFS)算法中,通常使用哪种数据结构来管理待访问的顶点",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":28,"type":29},[],283991899,[102,103,104,105],"n × n","n × (n-1)","n ×2","(n-1) × (n-1)","在图的邻接矩阵表示法中,如果图中有n个顶点,则邻接矩阵的大小为",1]