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