graphlayouts

From MaRDI portal
Revision as of 18:56, 12 March 2024 by Import240312060351 (talk | contribs) (Created automatically from import240312060351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:86062



CRANgraphlayoutsMaRDI QIDQ86062

Additional Layout Algorithms for Network Visualizations

Author name not available (Why is that?)

Last update: 19 January 2024

Copyright license: No records found.

Software version identifier: 0.8.4, 1.0.0, 0.1.0, 0.2.0, 0.5.0, 0.6.0, 0.7.0, 0.7.1, 0.7.2, 0.8.0, 0.8.1, 0.8.2, 0.8.3, 1.0.1, 1.0.2, 1.1.0

Several new layout algorithms to visualize networks are provided which are not part of 'igraph'. Most are based on the concept of stress majorization by Gansner et al. (2004) <doi:10.1007/978-3-540-31843-9_25>. Some more specific algorithms allow the user to emphasize hidden group structures in networks or focus on specific nodes.


No records found.




This page was built for software: graphlayouts