Closed MAL-iu closed 3 years ago
you can use graph = Graph.DAG(n, m)
to generate one directed acyclic graph. If you have to make a 'Non-connected graph', you can generate multiple DAGs and change the number of the vertices.
------------------ 原始邮件 ------------------ 发件人: "luogu-dev/cyaron" <notifications@github.com>; 发送时间: 2020年11月3日(星期二) 晚上7:11 收件人: "luogu-dev/cyaron"<cyaron@noreply.github.com>; 抄送: "Subscribed"<subscribed@noreply.github.com>; 主题: [luogu-dev/cyaron] 关于非联通图的生成 (#85)
怎么样能生成一个非联通的有向无环图呢,貌似graph里没有loop这个参数。
— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub, or unsubscribe.
怎么样能生成一个非联通的有向无环图呢,貌似graph里没有loop这个参数。