Kamada & Kawai graph layout algorithm? [closed]

Question

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.

---

Want to improve this question? Update the question so it's on-topic for Stack Overflow.

Closed 4 years ago.

Improve this question

Anyone out there ever attempted Kamada & Kawai's '88 Algorithm for drawing general undirected graphs?

If so, and you know of any resources on it (apart from the paper itself), links would be appreciated (extra points if anyone knows of any concise, step by step breakdowns).

Thanks!

Answer 1

If you search on Google Scholar for the name of Kamada and Kawai's paper "An Algorithm for Drawing General Undirected Graphs", the first hit includes a link, which is broken. But if you click on Versions, you can select other sources of the paper as PDF. Here is one for example from the Wellesley College

Here is my workflow for getting papers:

1. Search on Google Scholar for <paper title>
2. Check all versions
3. Check the university homepage of the author(s)
4. Search for "<paper title> pdf" on google search
5. Search the eBook section of my university library

Answer 2

Kamada-Kawai is implemented in igraph (e.g. the R package, though you can also use it as a Python library I believe).

Answer 3

Even later to the party, but FTR the C++ boost library has an implementation as well:

http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/kamada_kawai_spring_layout.html

Answer 4

Maybe I'm late to the party. Cytoscape does implement this algorithm. It is available under layout --> Edge-weighted spring embedded. for more details, check the code source of the algorithm implementation

Answer 5

There is also http://graphsharp.codeplex.com which provides a number of layout algorithms for C#.