[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fmQDPGiC6elxUeaDvWys5WmbtuG3GsrGNjHAQ0yNG1LY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-05-05 17:07:04",141502572,[8,9,10,11],"顶点v的度","顶点v的出度","顶点v的入度","依附于顶点v的边数",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},9,"f053f13e79950a02247128d6cc440800","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F28cc49cc9b62b61bb3e9c0e5d4e5e7c5.png","2023级数据结构","work_34765869","第19讲 图的存储结构","在有向图的邻接表存储结构中,顶点v在边表中出现的次数是( )",[21,32,41,44,53,62,71,80,85],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],141502570,[25,26,27,28],"与图的顶点数和边数有关","只与图的边数有关","只与图的顶点数有关","与边数的平方有关","用邻接表法存储图时,所用的空间大小( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],141502571,[36,37,38,39],"图中有奇数个结点","图中有偶数个结点","图为有向图","图为无向图","若邻接表中有奇数个边表结点,则( )",{"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":52,"source":30,"type":31},[],141502573,[48,49,50,51],"n*n","n*(n-1)","n*(n+1)","n*(n-1)\u002F2","n个顶点的无向图的邻接表最多有( )个边表结点",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],141502574,[57,58,59,60],"O(n)","O(e)","O(n+e)","O(ne)","假设有n个顶点、e条边的有向图用邻接表表示,则删除与某个顶点v相关的所有边的时间复杂度为( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],141502575,[66,67,68,69],"无向图的邻接表中,第i个顶点的度为第i个链表中结点数的两倍","邻接表比邻接矩阵的操作更简便","邻接矩阵比邻接表的操作更简便","求有向图结点的度,必须遍历整个邻接表","对邻接表的叙述中,( )是正确的",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],141502576,[75,76,77,78],"无向图","有向图","无向图和有向图","都不是","邻接多重表是( )的存储结构",{"answer":81,"createTime":5,"id":82,"options":83,"question":84,"source":30,"type":31},[],141502577,[75,76,77,78],"十字链表是( )的存储结构",{"answer":86,"createTime":87,"id":88,"options":89,"question":94,"source":30,"type":95},[],"2025-05-18 15:32:13",188775104,[90,91,92,93],"用邻接矩阵存储图,占用空间大小只与图中顶点数有关,而与边数无关","用邻接矩阵存储图,占用空间大小只与图中边数有关,而与顶点数无关","用邻接表存储图,占用空间大小只与图中顶点数有关,而与边数无关","用邻接表存储图,占用空间大小只与图中边数有关,而与顶点数无关","下面关于图的存储结构叙述中不正确的是( )",1]