About igraph releases and other things
The version number is not a mistake, we jump to 0.6.5 from 0.6, for technical reasons.
igraph 0.6.5 is a minor release that contains only few big changes, and fixes a number of very annoying bugs.
See at the end for the complete list of changes. First let’s see the most important new features and changes.
It is now possible to create user-defined vertex shapes for drawing
graphs in R. See
vertex.shapes() in the R manual.
See more in the manual.
We added some new functions if a sequence of integers is graphial, i.e. it can be the degree sequence of a simple graph. See more in the manual.
It is possible now to generate regular random graphs, faster than the general degree sequence based generator. See more in the manual.
This release includes the plfit library to maximum likelihood fit power laws to discrete or contiouous data. See more in the manual.
Many basic graph operations (eg. printing the summary to the screen, querying attribute values) now avoid copying the graph, so these operations are now much faster in R.
get.data.frame()function, opposite of
degree.sequence.game()has a new method now:
rewire()has a new method:
loops, that can create loop edges.
layout.mds()returns a layout matrix now.
layout.mds()uses LAPACK instead of ARPACK.
~character in write.graph and read.graph. Bug #1066986.
power.law.fit() can now use a C implementation.
out.seqwas an empty vector.
graph.adjacency(). Bug #1019624.
minimal.st.separators()bug, some vertex sets were incorrectly reported as separators. Bug #1033045.
shortest.paths()(Dijkstra’s algorithm.) Thanks to Martin J Reed.
vidsif it is
pievertices were drawn together with other vertex shapes.
layout.merge()s DLA mode has better defaults now.
layout.mds()that resulted vertices on top of each other.
layout.spring(), it was not working properly.
layout.svd(), which was completely defunct.
layout.graphopt()that caused warnings and on some platforms crashes.
community.to.membership(). Bug #1022850.
graph.incidence()crash if it was called with a non-matrix argument.
get.shortest.paths()bug, when output was set to
NAfor isomorphism classes that are not motifs (i.e. not connected). Fixes bug #1050859.
get.adjacency()when attr is given, and the attribute has some complex type. Bug #1025799.
graph.adjacency()for dense matrices. Bug #1066952.
diag=FALSE. Closes issue #1077425.
radius(), the results were often simply wrong.
get.all.shortest.paths()when some edges had zero weight.
graph.data.frame()is more careful when vertex names are numbers, to avoid their scientific notation. Fixes issue #1082221.
NAs in vertex names. Fixes issue #1087215
mode != ALL.
has.multiple()that resulted in false negatives for some undirected graphs.