conda-forge / packages / r-graphlayouts

• 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 to emphasize hidden group structures in networks or focus on specific nodes.

copied from cf-staging / r-graphlayouts

• Conda
• Files
• Labels
• Badges

Filters

Type: All

• All
• conda

Version: 0.7.1

• All
• 1.2.2
• 1.2.1
• 1.2.0
• 1.1.1
• 1.1.0
• 1.0.2
• 1.0.1
• 1.0.0
• 0.8.4
• 0.8.3
• 0.8.2
• 0.8.1
• 0.8.0
• 0.7.2
• 0.7.1
• 0.7.0
• 0.6.0
• 0.5.0

Label: All

• All
• Files with no label
• cf202003
• main