[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f81oRzPTCICPICg5DcW-wx7z6FqJpjkWRpwC-RFKJHu8":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":8,"question":15,"related":16,"source":26,"type":95},[],"2025-11-13 22:41:16",233450286,[],{"count":9,"courseId":10,"courseImg":11,"courseName":12,"workId":13,"workName":14},13,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_47325930","图作业","已知有向图结构如下图所示:\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa32bfb36d923a8834a060d1281810478.png\"> 请写出其数据结构中的数据集合D=____,该图是____(选填:简单或非简单)图,结点V3的出度为____,V3的入度为____, V4的度为____,该图是____(选填:非强连通或强连通)图",[17,28,37,47,57,66,75,81,90,96],{"answer":18,"createTime":5,"id":19,"options":20,"question":25,"source":26,"type":27},[],233450277,[21,22,23,24],"先序遍历","中序遍历","后序遍历","层次遍历","图的广度优先遍历是二叉树( )的推广","v1",0,{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":26,"type":27},[],233450278,[32,33,34,35],"由连通网得到的边数最少的生成树","连通网的极小连通子图","由连通网得到的顶点数相对较少的生成树","连通网的所有生成树中权值之和最小的生成树","最小生成树是指( )",{"answer":38,"createTime":5,"id":39,"options":40,"question":46,"source":26,"type":27},[],233450279,[41,42,43,44,45],"a","b","c","d","e","有一个无向带权图,请按Prim算法求最小生成树(开始顶点为 A ),最后一次加入到生成树中的顶点是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fb3e40a83ec83f72d940bc93f5cccec68.png\">",{"answer":48,"createTime":5,"id":49,"options":50,"question":56,"source":26,"type":27},[],233450280,[51,52,53,54,55],"1","2","3","4","5","有一个无向带权图,请按克鲁斯卡尔算法求最小生成树,最后一次加入到生成树中的边的权值是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc4448868909b67f30e42eac967c45118.png\">",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":26,"type":27},[],233450281,[61,62,63,64],"O(e)","O(n)","O(n+e)","O(n∗e)","设图G有 n 个顶点和 e 条边,采用邻接表存储,则拓扑排序算法的时间复杂度为( )",{"answer":67,"createTime":5,"id":68,"options":69,"question":74,"source":26,"type":27},[],233450282,[70,71,72,73],"非连通","连通","强连通","有向","若从无向图的任意一个顶点出发进行一次深度优先搜索可以访问图中所有的顶点,则该图一定是( )图",{"answer":76,"createTime":5,"id":77,"options":78,"question":80,"source":26,"type":27},[],233450283,[79,51,52,54],"1\u002F2","在一个有向图中,所有顶点的入度之和等于所有顶点的出度之和的( )倍",{"answer":82,"createTime":5,"id":83,"options":84,"question":89,"source":26,"type":27},[],233450284,[85,86,87,88],"n","2(n-1)","n\u002F2","n2","n个顶点的无向连通图用邻接矩阵表示时,该矩阵至少有( )个非零元素",{"answer":91,"createTime":5,"id":92,"options":93,"question":94,"source":26,"type":95},[],233450285,[],"有某专业的课程设置表如表1所示,在该表中有《高等数学》、《计算机导论》等7门课程,分别用编号C1、C2等表示,课程之间有先后修的关系,先后关系如表1所示,你认为用哪种数据结构能反应出课程先后修关系,说明理由.表1 某专业课程设置表 编号 课程名称 先修课 C1 高等数学 无 C2 计算机导论 无 C3 离散数学 C1 C4 程序设计基础 C1, C2 C5 数据结构与算法 C3,C4 C6 计算机组成原理 C2,C4 C7 数据库概论 C5",2,{"answer":97,"createTime":5,"id":6,"options":98,"question":15,"source":26,"type":95},[],[]]