Hi Dimitar,
That code was written by Tuomas Lukka. He is probably the only one who
could help you out, but has been quiet on this list for some time.
So you might be on your own...
Christian
Dimitar Kenanov wrote:
Hello guys,
i am trying to see what can be done with Mathgraph. I have some progress
already but i still have problems with this graphevolver. What exactly
is doing this part of the code. There is some repulse and attract but
when is the final stage reached i mean the stable state of the vertices?
I managed to make the sample tmathgraph.p work and yet is not obvious
what exactly demonstrates this code. I see a graph on the screen and
some coords changing all the time in my terminal window but theres no
update on the screen. So i dont get it.
I have another question. For the time being i see everytime a graph is
being created the coords are all da time different. I suppose because of
the "random" function used. And all the time i have the same number of
vertices and links between them but i have a different topolgy of the
vertices on the graph. I mean shouldnt the attract and repulse system
give all the time similar if not same result. Or may it depends on the
initial coords of the vertices. But i think now they are at first
random. So how can i make it so that the resulting graph with same
number of vertices and connections is always giving the same result. To
restrict the initial coords of the vertices or to give them some
standart ones?
May be my mail is a bit messy but so is the code :) Not that i complain
i just would like to get some help.
Please help.
Dimitar
_______________________________________________
Perldl mailing list
[email protected]
http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
