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