graphlayouts (Q86062)

From MaRDI portal
Additional Layout Algorithms for Network Visualizations
Language Label Description Also known as
English
graphlayouts
Additional Layout Algorithms for Network Visualizations

    Statements

    0.8.4
    24 November 2022
    0 references
    1.0.0
    1 May 2023
    0 references
    0.1.0
    5 April 2019
    0 references
    0.2.0
    4 July 2019
    0 references
    0.5.0
    20 August 2019
    0 references
    0.6.0
    9 March 2020
    0 references
    0.7.0
    25 April 2020
    0 references
    0.7.1
    26 October 2020
    0 references
    0.7.2
    21 November 2021
    0 references
    0.8.0
    3 January 2022
    0 references
    0.8.1
    11 August 2022
    0 references
    0.8.2
    29 September 2022
    0 references
    0.8.3
    20 October 2022
    0 references
    1.0.1
    19 September 2023
    0 references
    1.0.2
    3 November 2023
    0 references
    1.1.0
    19 January 2024
    0 references
    0 references
    0 references
    0 references
    19 January 2024
    0 references
    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.
    0 references
    0 references
    0 references
    0 references