[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$farIR63usyW_9ModRbX6GUyNX2eR052vDVbDLIyCHUC0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2023-12-10 00:44:54",112338462,[8,9,10,11],"1","3","2","4",{"courseId":13,"courseImg":14,"courseName":15},"2799fce499b1ad59f7723c476b27c813","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbbff4c540298f7bb07fe097d56991ecd.jpg","数据结构（python版）","下图中的强连通分支的个数为多少个? \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa06eedb7bc79bb09dbc6df07b0246210.png\">",[18,29,38,41,50,59,69],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],112338458,[22,23,24,25],"当图中不存在负权边时,Dijkstra算法能求出每对顶点间最短路径","Dijkstra算法的使用条件,要求整个图架构与所有边的权重均已知","当图中存在负权边时,Dijkstra算法必定不能求出源点到所有点的最短路","当图中存在负权边时,Dijkstra算法不一定能求出源点到所有点的最短路","下列关于Dijkstra算法的说法错误的有","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],112338459,[33,34,35,36],"一个无环有向图的拓扑排序序列必唯一","一个图的邻接矩阵表示是唯一的","一个图的生成树必为该图的极小连通子图","一个图的邻接表表示是不唯一的","下列说法错误的是",{"answer":39,"createTime":5,"id":6,"options":40,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":27,"type":28},[],112338463,[45,46,47,48],"abcefd","abefdc","abedfc","abecfd","无向图G=(V, E),其中:V={a, b, c, d, e, f}, E={(a, b), (a, e), (a, c), (b, e), (c, f), (f, d), (e, d)},对该图进行深度优先遍历(优先访问编号小的结点),得到的顶点序列为",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":27,"type":28},[],112338464,[54,55,56,57],"其他选项都不对","02 14 25 35 12","02 35 14 25 12","02 25 35 12 14","请使用Prim算法从结点0出发求下图的最小生成树,依次写出每次被加入到最小生成树中边的编号(如果同时存在多条边满足要求,选择编号最小的).顶点a到顶点b (a < b)之间的边编号为ab,例如图中权值为1的边编号为02. \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F343702921e6397071e6f018e79d93f2a.png\">",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":27,"type":68},[],112338467,[63,64,65,66],"对于有向图,所有结点的入度加起来一定是偶数","对于一个无向的连通图,一定存在一种给边指定方向的方案使得这个图变成强连通图","对于无向图,所有结点的度数加起来一定是偶数","将有向图的一个强连通分量中的边全部反向仍然是强连通分量","选出正确的叙述",1,{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":27,"type":68},[],112338468,[73,74,75,76],"2134","1234","1342","1324","有向图G具有四个顶点1~4和三条边1->3, 2->4, 3->4,选出它可能的拓扑排序"]