The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
edge_bundle(), a single entry point that
dispatches to any bundler via
type = c("force", "divided", "stub", "path", "hammer", "mingle")igraph calls to the 2.x API, removing
deprecation warningsedge_bundle_force() now also accepts a two-column
edgelist matrixedge_bundle_stub(): the angular grouping was
broken (wrong circular-gap handling and a bundle-size cap that summed
cluster ids instead of counting edges) and vertical edges could produce
NaN. Bundling output changes as a resultedge_bundle_path(): the path-length used in the
distortion test was computed along the wrong vertices, so edges were
essentially never routed. Bundling output changes as a resultedge_bundle_force(directed = TRUE) (Selassie et al. 2011):
edges running in opposite directions are kept in separate lanesedge_bundle_hammer() is now a native C++ implementation
of KDE edge bundling (Hurter et al. 2012) and no longer depends on
Python/reticulate/datashader. reticulate was
dropped from Imports and install_bundle_py() was removed.
Bundling output differs from the datashader-based versionedge_bundle_mingle(), multilevel agglomerative
edge bundling (Gansner et al. 2011); the kNN proximity graph is built
with a bundled kd-tree (nanoflann) for O(E log E) scaling, with a
k parameter for the number of merge candidates per
edgemetro_multicriteria() is deprecated in favour of
graphlayouts::layout_as_metromap() and will be removed in a
future releaseflow_tree(), a spiral-tree flow map (Verbeek,
Buchin & Speckmann 2011): planar, angle-restricted, keeps node
positions fixed, and needs no dummy nodes or triangulation. It is the
recommended flow map layout; the tnss_*() functions remain
as an alternative. flow_tree(optimize = TRUE) additionally
refines the tree (smoothness + obstacle avoidance) with join points held
fixedtnss_tree(): order = "weight" now orders
leaves by flow magnitude (previously a no-op); fixed a bug in
tnss_dummies() where one diagonal corner was misplaced;
removed dead code. interp moved from Imports to Suggests
(only tnss_tree() needs it)tnss_tree() to
Visvalingam algorithm (NOTE: The meaning of the epsilon parameter is now
reversed!)tnss_tree() which created duplicated
mesh pointsedge_bundle_path()tnss_tree()NEWS.md file to track changes to the
package.These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.