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

Any way to make it NOT rearrange the entire graph every time a node is changed? #42

Open
GoogleCodeExporter opened this issue Jun 17, 2015 · 2 comments

Comments

@GoogleCodeExporter
Copy link

What steps will reproduce the problem?
1.
2.
3.

What is the expected output? What do you see instead?


What version of the product are you using? On what operating system?


Please provide any additional information below.
It seems to me that part of what makes this so slow when stepping through
code is that every time it adds or changes a node, it rearranges the entire
graph and redraws it.  Is there any way to make it so that a change to a
node makes an "isolated" change, so it doesn't have to redraw the entire
graph?  Along with this, I can see the possibility of a "redraw" function,
which would recenter and redraw, in case "isolated" draws made for an
awkward picture.

Original issue reported on code.google.com by davidmic...@gmail.com on 16 Sep 2009 at 1:55

@GoogleCodeExporter
Copy link
Author

I don't know if the Zest supports partially relayouting of the graph, but even 
if it
does, we still need the delta of the model change event, which is not supported 
by
the debug framework, as it only throws event telling that the stack frame is 
changed,
without any info about what changed exactly. 

Anyway, the idea is worth some time to be tought through.

Original comment by balage.g on 24 Sep 2009 at 8:26

@GoogleCodeExporter
Copy link
Author

I made some minor adjustments. It does not solve the problem, but helps a bit.

The speed of layout algorithms are different - generally the tree algorithm is 
the
fastest, so it is selected as a default algorithm.

Zest does not support partial relayouting in general, however some layout 
algorithms
are less likely to respond with global layout changes to local changes (the tree
layout is one of them).

Original comment by Stampie.hun@gmail.com on 4 Oct 2009 at 1:52

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant