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.

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

Speed up the searching of AICs and CNLs #5

Closed
SunnieShine opened this issue Apr 14, 2020 · 0 comments
Closed

Speed up the searching of AICs and CNLs #5

SunnieShine opened this issue Apr 14, 2020 · 0 comments
Labels
Kind-enhancement New feature or request

Comments

@SunnieShine
Copy link
Owner

The speed of AICs and CNLs will be so slow because the algorithm does not use any cache to process or save the strong or weak relations (strong or weak links). In addition, the algorithm can be replaced with BFS, which reduces some unnecessary backtracking.
If using BFS, the searching will be faster than DFS, or use same time with DFS used.

@SunnieShine SunnieShine added Kind-enhancement New feature or request author found labels Apr 14, 2020
@SunnieShine SunnieShine added this to the Backlog milestone Jun 23, 2020
@SunnieShine SunnieShine changed the title Speed up the searching of AICs and CNLs. Speed up the searching of AICs and CNLs Aug 20, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Kind-enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant