[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fP6xwbmmKPP9sk9rq9Puq1alb9whgC0GR_I-dc2eFrwk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-03-06 14:53:47",133151388,[8,9,10,11],"入边","出边","入边和出边","不是出边也不是入边",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},61,"bdd665767202adf2f9e7a16501f8d82a","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","数据结构","work_32518547","作业四","在有向图的逆邻接表中,每个顶点邻接表链接着该顶点所有( )邻接点",[21,33,42,51,60,69,72,81,90,99],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-03-06 14:53:46",133151382,[26,27,28,29],"对称矩阵","零矩阵","上三角矩阵","对角矩阵","无向图的邻接矩阵是一个( )","v1",1,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],133151383,[37,38,39,40],"N-2","N-1","N","N+1","当利用大小为N的数组存储循环队列时,该队列的最大长度是( )",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":31,"type":32},[],133151384,[46,47,48,49],"顺序存储结构","链式存储结构","索引存储结构","散列存储结构","邻接表是图的一种( )",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":31,"type":32},[],133151385,[55,56,57,58],"125634","516234","123456","521643\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcfec0d9b480d105e23a15001a4fab201.png\">","下面有向图所示的拓扑排序的结果序列是( )",{"answer":61,"createTime":5,"id":62,"options":63,"question":68,"source":31,"type":32},[],133151387,[64,65,66,67],"顶点序列","边序列","权值总和","边的条数","在无向图中定义顶点vi与vj之间的路径为从vi到vj的一个( )",{"answer":70,"createTime":5,"id":6,"options":71,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":31,"type":32},[],133151389,[76,77,78,79],"G1是G2的子图","G2是G1的子图","G1是G2的连通分量","G2是G1的连通分量","设G1=(V1,E1)和G2=(V2,E2)为两个图,如果V1ÍV2,E1ÍE2则称( )",{"answer":82,"createTime":5,"id":83,"options":84,"question":89,"source":31,"type":32},[],133151390,[85,86,87,88],"将邻接矩阵的第i行删除","将邻接矩阵的第i行元素全部置为0","将邻接矩阵的第i列删除","将邻接矩阵的第i列元素全部置为0","已知一个有向图的邻接矩阵表示,要删除所有从第i个结点发出的边,应( )",{"answer":91,"createTime":5,"id":92,"options":93,"question":98,"source":31,"type":32},[],133151391,[94,95,96,97],"不存在","有一个","一定有多个","有一个或多个","任一个有向图的拓扑序列( )",{"answer":100,"createTime":5,"id":101,"options":102,"question":107,"source":31,"type":32},[],133151392,[103,104,105,106],"1\u002F2","1","2","4","在一个有向图中,所有顶点的入度之和等于所有顶点的出度之和的( )倍"]