This is an implementation of two Spring-embedder algorithms used for graph layout: Force-directed (Fruchterman - Reingold) and Local minimum energy (Kamada- Kawaii) in C language.
-
Updated
Feb 23, 2023 - C
This is an implementation of two Spring-embedder algorithms used for graph layout: Force-directed (Fruchterman - Reingold) and Local minimum energy (Kamada- Kawaii) in C language.
Add a description, image, and links to the force-layout topic page so that developers can more easily learn about it.
To associate your repository with the force-layout topic, visit your repo's landing page and select "manage topics."