add.edge.spell now allow to work with nodes and edges time spells.
check.dpl.edges, written in C, analyzes links and reports duplicates (marking them) and number of times the same link is repeated considering if the graph is directed or not.
switch.edges, also written in C, allows to order links representations (source and target) in order to set the smallest id as source and the highest as target.
write.gexf now has an improved error handler. Now parses objects before even opening the XML graph.
Edges support id assignment and labeling.
Small bug detected in viz attributes fixed.
Edges thickness viz att XML representation (
viz:thickness) was replaced by
viz:size (as it should be).
“Library” replaced by “Package” everywhere (
.addNodesEdges rewritten now works faster in most of CPUs (some of them with very high speedups) (Thanks to Duncan Temple Lang, RXML author)
Several code routines have been extracted from “bigger functions” and written as functions themselves.
rm.gexf.edge allow to build and manipulate
gexf objects from scratch.
read.gexf allows to import gexf files as
gexf class objects.
gexf function now it is called
Edges now allow weighting.
Viz Attributes (color, shape, size, etc.) can be included in both, nodes and edges.
Real-life datasets have been includded.
edge.list builds a dataframe of nodes from an edge list.
New methods for
gexf class objects are now a standard.
gexf is now named
Faster net build.
More demos + improve ones.
Fixing big misscoding at attvalues XML tag: it was replaced from "att" to "attvalue".
Fixing problem with XML value printing: Leading speces where removed from XML values at ids, source, target, etc.
Including a manual of the functions
Development repository more ordered acording to R package building.