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.
Initial CRAN submission.
node_vec(), a graph vector of nodes with edges
stored as attributes. Slicing induces a subgraph: edges that lose an
endpoint are dropped, and remaining endpoints are remapped.edge_vec(), a graph vector of edges with node
data stored as attributes. Slicing selects edges directly, leaving nodes
unaffected.agg_vec(), an aggregation vector: a
node_vec consisting of a parent value (the aggregated
value) and its disaggregated children.agg_df(), a table of agg_vec()
columns, one row per level of aggregation, which can be reoriented into
a graph.nodes()/edges() generics to
losslessly reorient a graph vector between node- and edge-indexed
forms.is_aggregated() to test whether an element is an
aggregation of smaller data.as.igraph() methods for node_vec,
edge_vec, agg_vec, and agg_df,
converting them to igraph::igraph() objects.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.