[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fGslCZe6dvkzeIAHiCvK46NjKAebH7s2uodUZr3Rhv-k":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-07-03 15:43:53",143668046,[8,9,10,11],"5","7","6","8",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},16,"7883662fe4ab672d5956725346e48a6e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1f45058291e8e7989eb496b2ae5f221f.png","数据结构","work_35067071","第6章 图1","具有6个顶点的无向图至少应有 条边才能确保是一个连通图",[21,32,41,44,52,59,68,73,82,90],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],143668044,[25,26,27,28],"n-1","n+e","n","n+1","对于一个具有n个顶点和e条边的无向图,若采用邻接表表示,则表头向量的大小为","v1",0,{"answer":33,"createTime":34,"id":35,"options":36,"question":40,"source":30,"type":31},[],"2024-05-28 21:32:11",143668045,[37,38,39,10],"12","16","20","具有4个顶点的无向完全图有 条边",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":51,"source":30,"type":31},[],143668047,[48,49,27,50],"2n","n(n-1)\u002F2","n(n-1)","一个有n个顶点的无向图最多有 条边",{"answer":53,"createTime":54,"id":55,"options":56,"question":58,"source":30,"type":31},[],"2024-07-03 14:08:58",143668048,[57,27,25,28],"n\u002F2","在一个具有n个顶点的无向图中,要连通全部顶点至少需要 条边",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],143668049,[63,64,65,66],"2","4","1","1\u002F2","在一个图中,所有顶点的度数之和等于所有边数的 倍",{"answer":69,"createTime":54,"id":70,"options":71,"question":72,"source":30,"type":31},[],143668050,[63,66,65,64],"在一个有向图中,所有顶点的入度之和等于所有顶点的出度之和的 倍",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":30,"type":31},[],143668051,[77,78,79,80],"矩阵中非全零行的行数等于图中的顶点数","第i行上,第i列上非零元素总数等于顶点vi的度数","矩阵中的非零元素个数等于图中的边数","第i行上的非零元个数和第i列的非零元个数一定相等","对某个无向图的邻接矩阵来说,",{"answer":83,"createTime":84,"id":85,"options":86,"question":89,"source":30,"type":31},[],"2024-05-28 21:32:12",143668052,[27,25,87,88],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fadfedf6fac792ae7f1800b5a22317e6c.webp\">","*(n-1)","对于一个具有n个顶点的无向图,若采用邻接矩阵表示,则该矩阵的大小是",{"answer":91,"createTime":5,"id":92,"options":93,"question":97,"source":30,"type":31},[],143668053,[26,94,95,96],"e\u002F2","2e","e","对于一个具有n个顶点和e条边的无向图,若采用邻接表表示,则所有邻接表中的结点总数为"]