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

环状依赖检查性能优化 #3

Open
harttle opened this issue Nov 20, 2019 · 0 comments
Open

环状依赖检查性能优化 #3

harttle opened this issue Nov 20, 2019 · 0 comments
Labels
performance

Comments

@harttle
Copy link
Collaborator

harttle commented Nov 20, 2019

目前在 make 中调用 DirectedGraph#checkCyclic() 来检查是否存在环。每次代价是 O(n)，总体 O(n^2)，n 为 make 被调用的次数。

优化思路：增量构造一个 Set 穿透每个 make dfs 中从 根 到 叶 的路径。每次代价减小到 O(1)。
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
performance
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@harttle