Clik here to view.
By: Neil Brown
This version is fairly unexciting (the nodes just move from the corners into position), but I will try to put together a slightly better, more complicated version that’s worth recording.
View ArticleBy: Dave
There’s recording an animation, and there’s off-screen anti-aliased rendering of HD video frame by frame for later playback. In general I want this for everything I’m planning graphically, so...
View ArticleBy: Ivan Miljenovic
Are you going to develop this into a full-blown graph layout tool for Haskell? I’m more than willing to be put out of a job writing the graphviz bindings! :p
View ArticleBy: Felipe Lessa
Is it because of the algorithm or the example? Does the algorithm converge this fast?
View ArticleBy: Neil Brown
Felipe: mainly the example. I have another post lined up with a video that shows the algorithm converging over time, which I’ll post later today.
View ArticleBy: Graph Layout with Software Transactional Memory and Barriers (plus...
[...] (plus video!) November 26, 2009 Neil Brown Leave a comment Go to comments In my last post, I used barriers and shared channels to write a simple program for performing force-based graph layou…....
View ArticleBy: Christophe Poucet
Hey, Interesting article. I still have to take the time to do more than just skim the code. But just FYI, here is a (small?) performance optimization. Make your node data strict: data NodeInfo =...
View ArticleBy: Concisely Expressing Behaviours with Process Combinators « Communicating...
[...] pattern, wherein simulation entities perform various optional activities until the phase moves on. For example, our graph nodes were willing to send out their position to anyone that attempted to...
View ArticleBy: Visualising Your Process Network « Communicating Haskell Processes
[...] well to visualisation. I don’t make as much use of it on this site as I should, but some previous posts show diagrams with processes (as nodes) joined by channels (as edges). I already have some...
View Article