Johann Philipp Strathausen

maker of dracula.js co-founder of FitAnalytics

June 1st, 2010

Dracula Graph Library v0.0.3alpha

Edit: This library moved to it's own a web site: graphdracula.net

I have updated the code of the dracula graph library! There are some changes, like now you have a simple option to add labels to connections by passing a label property when creating an edge and a simple overlay option for nodes. Note that the file names have also changed, but this shouldn’t be too hard to adopt to. Some source code refractoring has been done too and the getShape is now called render.

The biggest changes however are some search algorithms I implemented to work with the framework, Dijkstra, Bellman-Ford and Floyd-Warshall along with a priority queue based on a binary heap. I’m just doing this because I have to learn it, but my plans are to break these algorithms down into steps and have them explained visually to the user.

Roadmap

Here are the issues I’m working on until removing the alpha badge, some already pointed out by some of you:

Have a render function for every node, no matter how it was created.

Outlook

Some of the issues I will address in the future:

Examples

Here’s what it looks like in action currently (the tool-tip is just a dummy rounded square):

And the Dijkstra algorithm to search the shortest paths from Berlin to any city in the world:

Code

See it on GitHub or download the latest version directly!