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