Message Boards Message Boards

0
|
2524 Views
|
2 Replies
|
1 Total Likes
View groups...
Share
Share this post:

Looking for easier way to create and plot recombining trees

I need to creating and plot structures I call "recombining trees" a->{b->{d,e},c->{d,f}}. In version 12.3 trees have been improved, so I hope I can improve upon the method I have been using to create and plot trees. Take a look at the notebook to see what I am currently doing. Is there a way I can automate some of this to make creating trees less labor intensive. I feel like the way I am doing things is not leveraging the capabilities of the software.

POSTED BY: Robert Buchanan
2 Replies

Thanks for the explanation. It makes sense that what I am building is a graph and not a tree.

POSTED BY: Robert Buchanan
Posted 3 years ago

From here

In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path.

I think that explains why RulesTree does not generate the graph you expect. TreePlot works because the documentation says

If the graph g is not a tree, TreePlot lays out its vertices on the basis of a spanning tree of each connected component of the graph.

POSTED BY: Rohit Namjoshi
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract