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

More efficient algorithm to evaluate diagram tree #7

Closed
kunyuan opened this issue Nov 26, 2021 · 1 comment
Closed

More efficient algorithm to evaluate diagram tree #7

kunyuan opened this issue Nov 26, 2021 · 1 comment
Assignees
@kunyuan @houpc
Labels
enhancement New feature or request

Comments

@kunyuan
Copy link
Member

kunyuan commented Nov 26, 2021

In the naive algorithm, the entire diagram tree is recalculated. In a more advanced algorithm, one should only evaluate part of the tree in each MC update.
@kunyuan kunyuan added the enhancement New feature or request label Nov 26, 2021
@kunyuan
Copy link
Member Author

kunyuan commented Oct 31, 2024

not a good idea

@kunyuan kunyuan closed this as completed Oct 31, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@kunyuan kunyuan

@houpc houpc

Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@kunyuan @houpc