[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fShdCEIFoPJcfS9QX0vrXhEgt0WCZtV3r2MtnfjsXOWs":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-05-24 22:52:02",145889572,[8,9,10,11],"Dijkstra算法","Kruskal算法","Floyd算法","Prim算法",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},16,"fd2ecb80e3fdb82047dc8c27282ea8f4","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc456e1a1725a3bc3c703a210cf763a52.png","23级数据结构（72学时）","work_35212525","BUUCTF-Web-极客大挑战2019-EasySQL","下面( )算法适合构造一个稠密图G的最小生成树",[21,32,35,44,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],145889570,[25,26,27,28],"n","n+1","1","0","对于一个具有n个顶点的无向连通图,它包含的连通分量的个数为( )","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":30,"type":31},[],145889574,[39,40,41,42],"只有Ⅰ","Ⅰ和Ⅱ","只有Ⅱ","Ⅰ和Ⅲ","关于无向连通图特性的叙述中,正确的是( ).Ⅰ.所有顶点的度之和为偶数Ⅱ.边数大于顶点个数减1Ⅲ.至少有一个顶点的度为1",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],145889576,[48,49,50,51],"仅Ⅰ、 Ⅱ","仅Ⅱ","仅Ⅰ、 Ⅲ","仅Ⅲ","下列关于图的叙述中,正确的是( ).Ⅰ.回路是简单路径Ⅱ.存储稀疏图,用邻接矩阵比邻接表更省空间Ⅲ.若有向图中存在拓扑序列,则该图不存在回路",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],145889578,[57,58,59,60],"O(n+e)","O(n)","O(e)","O(n-e)","图的深度优先或广度优先遍历的空间复杂性均为( ).(访问标志位数组空间)",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],145889580,[66,67,68,69],"1,2,1,2","3,4,2,3","2,2,1,1","4,4,2,2","设图的邻接矩阵A如下图所示,各顶点的度依次是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0e1302a27f0596c37836810412fe5311.png\">",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],145889582,[75,76,77,78],"求关键路径","求最短路径","深度优先遍历","拓扑排序","下面( )方法可以判断出一个有向图是否有环",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],145889584,[84,85,86,87],"大或相等","小或相等","相等","小","图的BFS生成树的树高比DFS生成树的树高( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],145889586,[93,94,95,96],"度数减1","入度数","出度数","度数","在一个有向图的邻接表中,每个顶点单链表中结点的个数等于该顶点的( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":104,"source":30,"type":31},[],145889588,[28,102,27,103],"i+j","i-j","在无向图G的邻接矩阵A中,若A[i,j]等于1,则A[j,i]等于( )"]