[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fouhgVyDk59KaxfONL_FYZmQnQiOiM97m9JV5Zphau6Y":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-01-02 23:32:14",125906940,[8,9,10,11],"n*n","n(n+1)","n\u002F2","n*(n-l)",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},280,"65b67859a299eb8bfdc4b795152daa90","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8f6d1861c2d7225ca42808692d75026e.jpg","数据结构","work_31968363","第六章 学习法治思想 提升法治素养","7-1-5.n个结点的完全有向图含有边的数目()",[21,32,41,49,52,62,71,76,82,87],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],125906933,[25,26,27,28],"由顶点和相邻顶点序偶构成的边所形成的序列","由不同顶点所形成的序列","由不同边所形成的序列","上述定义都不是","7-1-1.图中有关路径的定义是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],125906935,[36,37,38,39],"n-1","n","n+1","nlogn","7-1-3.一个n个顶点的连通无向图,其边的个数至少为( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":48,"source":30,"type":31},[],125906936,[45,37,46,47],"n-l","n+l","2n","7-1-4.要连通具有n个顶点的有向图,至少需要( )条边",{"answer":50,"createTime":5,"id":6,"options":51,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":53,"createTime":54,"id":55,"options":56,"question":61,"source":30,"type":31},[],"2024-01-02 23:32:15",125906943,[57,58,59,60],"1\u002F2","2","1","4","在一个无向图中,所有顶点的度数之和等于所有边数( )倍",{"answer":63,"createTime":54,"id":64,"options":65,"question":70,"source":30,"type":31},[],125906945,[66,67,68,69],"图的遍历是从给定的源点出发每一个顶点仅被访问一次","图的深度遍历不适用于有向图","遍历的基本算法有两种:深度遍历和广度遍历","图的深度遍历是一个递归过程","7-1-10. 下列说法不正确的是( )",{"answer":72,"createTime":54,"id":73,"options":74,"question":75,"source":30,"type":31},[],125906946,[57,58,59,60],"7-1-20.在一个有向图中,所有顶点的入度之和等于所有顶点出度之和的( )倍",{"answer":77,"createTime":54,"id":78,"options":79,"question":81,"source":30,"type":31},[],125906947,[59,58,80,60],"3","有向图如下图所示,顶点A的度为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F490631b47b4ead2027bcc628e4fbd628.png\">",{"answer":83,"createTime":54,"id":84,"options":85,"question":86,"source":30,"type":31},[],125906950,[57,58,59,60],"在一个有向图中,所有顶点的度数之和等于所有边数( )倍",{"answer":88,"createTime":54,"id":89,"options":90,"question":94,"source":30,"type":31},[],125906951,[36,91,92,93],"n(n-1)\u002F2","n(n+1)\u002F2","n(n-1)","设有向图的顶点个数为n,则该图最多有( )条边"]