Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

望加强图生成部分 #13

Open
iamgqr opened this issue May 16, 2017 · 12 comments
Open

望加强图生成部分 #13

iamgqr opened this issue May 16, 2017 · 12 comments
Assignees
@lin-toto @kkksc03
Labels
enhancement

Comments

@iamgqr
Copy link

iamgqr commented May 16, 2017

可以做无权图（虽然现在可以做但是必须手写函数）、DAG图吗？还有重边、自环的控制，望加强。如果还有基环图、仙人掌图，就更好了~
=D

另：有随机询问生成器吗。。。
@lin-toto
Copy link
Member

随机询问的话，自己randint基本就可以了吧

@iamgqr
Copy link
Author

iamgqr commented May 30, 2017 •
edited
Loading

好的，但是如果题目例如说“询问的两个节点必须在同一个联通快内”好像比较麻烦。。。
对了怎么生成连通图
但是还是狠滋磁的 滋磁dalao

@lin-toto
Copy link
Member

好像不存在这个feature的样子

@lin-toto
Copy link
Member

lin-toto commented Jul 3, 2017

@fjzzq2002
连通图这个，您有什么想法啊

@iamgqr
Copy link
Author

iamgqr commented Jul 9, 2017

用个并查集什么的，当剩余边数等于并查集数量的时候，只允许连接在两个不同并查集中的节点（否则重新rand），应该不是很难写吧QAQ

@ghost
Copy link

ghost commented Aug 26, 2017

还有DAG。。qwq好多算法都不能用啊

@imdlxx
Copy link

imdlxx commented Nov 19, 2017

。。。

@WAAutoMaton
Copy link
Contributor

现在可以生成无权图了（其实就是原来要手写的输出函数现在内置了一个）

@imdlxx
Copy link

imdlxx commented Jan 29, 2018 via email

@YanWQ-monad
Copy link
Contributor

我已经实现了 DAG，等有空我把测试写完之后我发一个 PR。
可以先去这里参观一下。
我的 DAG 其实就是在树的基础上加工一下，希望勿喷。

@YanWQ-monad
Copy link
Contributor

关于有向图的环，我可能还要再思考一下

@YanWQ-monad YanWQ-monad mentioned this issue Sep 5, 2018
Merged
@qinwang-ai
Copy link

铜球连通图。。一稀疏了就不联通了。。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@lin-toto lin-toto

@kkksc03 kkksc03

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
7 participants
@lin-toto @kkksc03 @qinwang-ai @iamgqr @YanWQ-monad @WAAutoMaton @imdlxx