Tagged Questions
2
votes
1answer
170 views
Changing some stuff to Kruskal's Algorithm
I'm trying to modify this algorithm:
http://demonstrations.wolfram.com/ConnectingTownsUsingKruskalsAlgorithm/
The thing is that I want to receive a Graph (declared outside, with all its vertex, edges ...
16
votes
3answers
675 views
How to generate a random tree?
Is it possible to generate a random tree without explicitly constructing a random adjacency matrix that satisfies tree properties? How about a random directed tree?
Edit: incredible answer by ...
10
votes
1answer
180 views
Transform an expression into a graph that can be plotted with TreeGraph (not TreeForm)
I would like to plot an expression (like TreeForm does), but using the new TreeGraph functionality.
...
13
votes
1answer
259 views
Visiting nodes in a tree bottom up
I have a problem that can be reduced to this one:
Suppose I have an unbalanced (almost random) tree. The leaves of the tree have one property already set, and all vertex (including the leaves) have ...
6
votes
2answers
166 views
Truncate TreeForm to show only the top
For some expressions, TreeForm may grow very long. I'm only interested in the top levels of the expression. How can I get the tree form of only the first levels an ...
