Auar / flexvizgraphlib

Automatically exported from code.google.com/p/flexvizgraphlib
0 stars 0 forks source link

disconnected graphs get lost #11

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago
What steps will reproduce the problem?
Comment out line 611 in RelationNavigatorDemo.mxml (<Edge fromID="vizgraph"
toID="flex_utils" /><Edge fromID="vizgraph" toID="flex_utils" />) The idea
is to produce a disconnected graph. 

What is the expected output? What do you see instead?
I expected to see two disconnected sub-graphs in the display. Instead, I
only saw one. The rest of the data was lost. 

What version of the product are you using? On what operating system?
I'm using the trunk version as of 09 October 2007. 

Please provide any additional information below.
I looked at the comments in VisualGraph.as and it seems that this projects
currently takes the view of graph == tree. While all trees are graphs, not
all graphs are trees. I suppose one approach to implementing a graph is to
have a set of trees instead of the traditional set of nodes and set of
links, but this does not seem to be what is going on here or I would have
seen all the data when I did my experiment. Does this project plan to
support graphs that aren't connected? Or should this have been a feature
request?

Original issue reported on code.google.com by ntijer...@gmail.com on 10 Oct 2007 at 6:11

GoogleCodeExporter commented 9 years ago
Ntijerino,

Thanks for the comment.  You raise a very good point.  For this library to be
comprehensive and accommodate all facets of graph theory, you are right, it 
will need
to support disconnected graphs.  We do intend to support this function however 
would
appreciate any contributions in this regard.

Original comment by jbell...@unog.ch on 14 Oct 2007 at 9:50

GoogleCodeExporter commented 9 years ago
Hi, yes we aware of this severe limitation. There are several issues associated 
with
it. General graphs or even forests create a layouting problem. We currently do 
not
have layouters that would work on disconnected graphs (although the hyperbolic 
might
do), most even require trees. While we can always compute a spanning tree in a
connected graph all disconnected components will be lost from the spanning tree 
and
thus not be rendered for now.
I do not see a conceptual solution for this issue right now, but I am happy for 
any
suggestions. 

Original comment by spo...@gmail.com on 21 Mar 2008 at 3:27