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

add tarjan 的最小树形图算法 #1765

Closed
Ir1d opened this issue Oct 17, 2019 · 2 comments
Closed

add tarjan 的最小树形图算法 #1765

Ir1d opened this issue Oct 17, 2019 · 2 comments
Labels
Content Request / 内容请求 New feature or request

Comments

@Ir1d
Copy link
Member

Ir1d commented Oct 17, 2019

首先，十分欢迎你来给 OI WIki 开 issue，在提交之前，请花时间阅读一下这个模板的内容，谢谢合作！

  • 希望添加的是什么？

  • 英文叫什么？

《Efficient algorithms for finding minimum spanning trees》

nlogn + m 的，看起来很厉害

issue 标题请写为 'add ' + 要添加的内容

Originally posted by @AmetsujiTachiaki in OI-wiki/gitment#288 (comment)
@abc1763613206 abc1763613206 added the Content Request / 内容请求 New feature or request label Oct 17, 2019
@HeRaNO
Copy link
Collaborator

HeRaNO commented Oct 18, 2019

可以参考 riteme 的这篇博客

@abc1763613206 abc1763613206 mentioned this issue Oct 28, 2019
Closed
61 tasks
@ShaoChenHeng
Copy link
Contributor

我正在编写这个内容

@StudyingFather StudyingFather mentioned this issue Aug 24, 2020
Closed
58 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
Content Request / 内容请求 New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
4 participants
@Ir1d @HeRaNO @ShaoChenHeng @abc1763613206