The dyng library is a simple C++ library for dynamic graph layout.

See How to compile the demo for a guide on how to compile a graphic demo showcasing the library.

Refer to Quick start to learn how to integrate this library in your project and how to use it.

Full documentation is available online at https://bleskocvok.github.io/dyng/html/index.html.

Alternatively, it can be generated offline from the cloned repository using Doxygen:

cd docs
doxygen

After which the main page can be accessed by opening docs/docs.html.

The project is licensed under the Apache License, Version 2.0. See the accompanying file named LICENSE.

This library is the outcome of my bachelor's thesis, which can be accessed here. (It's written in the Czech language.)

The library currently uses a combination of the two algorithms described in these papers:

• Foresighted Layout with Tolerance
  Diehl S., Görg C. (2002) Graphs, They Are Changing. In: Goodrich M.T., Kobourov S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg
• Fruchterman–Reingold
  Fruchterman, T.M., & Reingold, E.M. (1991). Graph Drawing by Force-directed Placement. Softw. Pract. Exp., 21, 1129-1164.

A flaming graph.

See this for an answer.