[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fwDx8yaVhVvMxsTL590agejbO7ILtgq7aJ3pIm3vhofg":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":29,"type":86},[],"2023-12-29 10:42:32",123642798,[8,9],"正确","错误",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},17,"65b67859a299eb8bfdc4b795152daa90","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8f6d1861c2d7225ca42808692d75026e.jpg","数据结构","work_31896826","白盒测试技术——逻辑覆盖(2班)","拓扑排序算法不适合无向图的拓扑排序",[19,31,41,51,61,71,81,87,92,97],{"answer":20,"createTime":21,"id":22,"options":23,"question":28,"source":29,"type":30},[],"2023-12-26 11:43:45",121869140,[24,25,26,27],"求关键路径的方法","求最短路径的 Dijkstra方法","深度优先遍历算法","广度优先遍历算法","判定一个有向图是否存在回路除了可以利用拓扑排序方法以外,还可以用___________","v1",0,{"answer":32,"createTime":33,"id":34,"options":35,"question":40,"source":29,"type":30},[],"2023-12-26 11:44:53",121869179,[36,37,38,39],"是个有根有向图","是个强连通图","含有顶点数目大于1的强连通分量","含有多个入度为0的顶点","若一个有向图中的顶点不能排成一个拓扑序列,则可断定该有向图___________",{"answer":42,"createTime":43,"id":44,"options":45,"question":50,"source":29,"type":30},[],"2023-12-26 11:46:18",121869194,[46,47,48,49],"adcbe","dabce","abdce","abcde","设有一个不带权的有向图G=(V,E),V={a,b,c,d,e},E={<a,b>,<a,c>,<d,c>,<d,e>,<b,e>,<c,e>},对该图进行拓扑排序,以下序列中不是拓扑序列的是( )",{"answer":52,"createTime":53,"id":54,"options":55,"question":60,"source":29,"type":30},[],"2023-12-26 11:46:53",121869203,[56,57,58,59],"任何一个关键活动提前完成,则整个工程也会提前完成","完成工程的最短时间是从源点到汇点的最短路径长度","一个AOE网的关键路径是唯一的","任何一个活动持续时间的改变可能会影响关键路径的改变","对于AOE网的关键路径,以下叙述中正确的是____",{"answer":62,"createTime":63,"id":64,"options":65,"question":70,"source":29,"type":30},[],"2023-12-26 11:47:06",121869211,[66,67,68,69],"从源点到汇点的最长路径","从源点到汇点的最短路径","最长的回路","最短的回路","关键路径是AOE网中___________",{"answer":72,"createTime":73,"id":74,"options":75,"question":80,"source":29,"type":30},[],"2023-12-26 11:47:17",121869253,[76,77,78,79],"必须是唯一的","可以有多条","可以没有","以上都不对","一个表示工程的AOE网中的关键路径( )",{"answer":82,"createTime":5,"id":83,"options":84,"question":85,"source":29,"type":86},[],123642784,[8,9],"强连通图不能进行拓扑排序",3,{"answer":88,"createTime":5,"id":89,"options":90,"question":91,"source":29,"type":86},[],123642786,[8,9],"在一个有向图的拓扑序列中若顶点a在顶点b之前,则图中必有一条边<a,b>",{"answer":93,"createTime":5,"id":94,"options":95,"question":96,"source":29,"type":86},[],123642793,[8,9],"无环有向图才能进行拓扑排序",{"answer":98,"createTime":5,"id":6,"options":99,"question":17,"source":29,"type":86},[],[8,9]]