Revision history [back]

Good afternoon, I have defined a recursive function and I would like to vizualise the 'calls' of the function trought a tree diagram. The nodes should be the elements of a group (Extended affine weyl group). So expressions of this type s0s1s2s4s5s6s0s0s7 (not hashable). Is there a easy way to do that ? Maybe using just matplotlib? So without instal graphviz. I need something simple like latex \tree. I have just tried something like this G = graphs.RandomGNM(4,5) G.relabel({0:'zero' , 1:'one', 2:'two', 3:'three'}) G.show(figsize=[4,4], graph_border=True) But the labels on the vertices are not readable. Really, I need something like a diagram not a graph.

Good afternoon, I have defined a recursive function and I would like to vizualise the 'calls' of the function trought a tree diagram. The nodes should be the elements of a group (Extended affine weyl group). So expressions of this type s0s1s2s4s5s6s0s0s7 (not hashable). Is there a easy way to do that ? Maybe using just matplotlib? So without instal graphviz. I need something simple like latex \tree. I have just tried something like this G = graphs.RandomGNM(4,5) G.relabel({0:'zero' , 1:'one', 2:'two', 3:'three'}) G.show(figsize=[4,4], graph_border=True) But the labels on the vertices are not readable. Really, I need something like a diagram not a graph.