On Tue, Mar 24, 2015 at 12:45 PM, Alexandre Bergel
<alexandre.bergel(a)me.com> wrote:
It would be fantastic to have a Roassal illustration
of the algorithm.
Yes !
Meanwhile, you can have a look to some basic complex network
generation algorithms I have done some months ago:
http://smalltalkhub.com/#!/~SergeStinckwich/Moose-Algos-Graph-Generators
Run in a playground:
| v g nodes edges |
v := RTView new.
g := MalErdosRenyiGNMGraphGenerator new.
g
nodes: (1 to: 1000);
edgesNumber: 700.
g run.
nodes := (RTEllipse new color: (Color purple alpha: 0.3); size:10)
elementsOn: g nodes.
nodes @ RTDraggable.
v addAll: nodes.
edges := RTEdge buildEdgesFromObjects: (g edges) from:#from to:#to
using: (RTLine new color: (Color purple alpha:0.2)) inView:v.
edges do: [: e| e trachelShape pushBack].
v addAnimation: (RTSpringLayoutStepping new view: v).
v @ RTDraggableView.
v
Regards,
--
Serge Stinckwich
UCBN & UMI UMMISCO 209 (IRD/UPMC)
Every DSL ends up being Smalltalk
http://www.doesnotunderstand.org/