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

第五題 #7

Open
TommyWu-fdgkhdkgh opened this issue Dec 2, 2017 · 6 comments
Open

第五題 #7

TommyWu-fdgkhdkgh opened this issue Dec 2, 2017 · 6 comments

Comments

@TommyWu-fdgkhdkgh
Copy link

十七組
@TommyWu-fdgkhdkgh
Copy link
Author

TommyWu-fdgkhdkgh commented Dec 2, 2017 •
edited
Loading

1.把減少權重的邊連上最小生成樹T
2.對此邊的任一點做DFS，找出環，與環上的各個邊
3.把環上權重最大的邊從T中消掉

時間複雜度：一個DFS，圖以adjacency list表示，O(|E|+|V|)

@scps940707
Copy link
Member

scps940707 commented Dec 4, 2017 •
edited
Loading

早安~你們的投影片還沒上傳呢！

你們DFS走的是最小生成樹，所以時間複雜度不應該是O(|E|+|V|)哦～

@TommyWu-fdgkhdkgh
Copy link
Author

了解～等等上傳

請問走最小生成樹的話，應該會是O(|V|)嗎？不太確定

@TommyWu-fdgkhdkgh
Copy link
Author

報告ppt_1.pptx

@TommyWu-fdgkhdkgh
Copy link
Author

報告ppt_2.pptx

@TommyWu-fdgkhdkgh
Copy link
Author

報告ppt_3.pptx

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@TommyWu-fdgkhdkgh @scps940707