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