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 to emphasize hidden group structures in networks or focus on specific nodes.
copied from cf-staging / r-graphlayouts
https://anaconda.org/conda-forge/r-graphlayouts/badges/version.svg
https://anaconda.org/conda-forge/r-graphlayouts/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-graphlayouts/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-graphlayouts/badges/platforms.svg
https://anaconda.org/conda-forge/r-graphlayouts/badges/license.svg
https://anaconda.org/conda-forge/r-graphlayouts/badges/downloads.svg