Fixed:
graph_from_adjacency_matrix()
now works with sparse matrices even if the cell values in the sparse matrix are unspecified.cluster_walktrap()
when modularity=FALSE
and membership=FALSE
edge_attr()
does not ignore its index=...
argument any more.automorphisms()
, automorphism_group()
and canonical_permutation()
now allow all possible values supported by the C core in the sh
argument. Earlier versions supported only "fm"
.vertex.frame.width
plotting parameter now allows zero and negative values; these will simply remove the outline of the corresponding vertex.sh
argument of the BLISS isomorphism algorithm in isomorphic()
was fixed; earlier versions incorrectly referred to sh1
and sh2
.dominator_tree()
now conforms to its documentation with respect to the dom
component of the result: it contains the indices of the dominator vertices for each vertex and -1 for the root of the dominator tree."power"
algorithm of page_rank()
have been removed from the documentation, as this method is no longer available.The C core is updated to 0.9.7, fixing a range of bugs and introducing a number of new functions.
Added:
has_eulerian_path()
and has_eulerian_cycle()
decides whether there is an Eulerian path or cycle in the graph.eulerian_path()
and eulerian_cycle()
returns the edges and vertices in an Eulerian path or cycle in the graph.any_loop()
checks whether a graph contains at least one loop edge.is_tree()
checks whether a graph is a tree and also finds a possible rootto_prufer()
converts a tree graph into its Prufer sequencemake_from_prufer()
creates a tree graph from its Prufer sequencesample_tree()
to sample labelled trees uniformly at randomsample_spanning_tree()
to sample spanning trees of an undirected graph uniformly at randomautomorphisms()
and canonical_permutation()
now supports vertex colorsrandom_edge_walk()
to record the edges traversed during a random walkharmonic_centrality()
calculates the harmonic centrality of vertices, optionally with a cutoff on path lengthsmean_distance()
now supports edge weights and it can also return the number of unconnected vertex pairs when details=TRUE
is passed as an argumentgreedy_vertex_coloring()
finds vertex colorings based on a simple greedy algorithm.bridges()
finds the bridges (cut-edges) of a graphframe.width
vertex attribute or the vertex.frame.width
keyword argument, thanks to @simoncarrignon . See PR #500 for more details.automorphism_group()
returns a possible (not necessarily minimal) generating set of the automorphism group of a graph.global_efficiency()
calculates the global efficiency of the graph.local_efficiency()
calculates the local efficiency of each vertex in a graph.average_local_efficiency()
calculates the average local efficiency across the set of vertices in a graph.rewire(each_edge(...))
now supports rewiring only one endpoint of each edge.realize_degseq()
generates graphs from degree sequences in a deterministic manner. It is also available as make_(degseq(..., deterministic=TRUE))
.clique_size_counts()
counts cliques of different sizes without storing them all.feedback_arc_set()
finds a minimum-weight feedback arc set in a graph, either with an exact integer programming algorithm or with a linear-time approximation.make_bipartite_graph()
now handles vertices with names.shortest_paths()
now supports graphs with negative edge weights.min_cut()
now supports s-t mincuts even if value.only=FALSE
.as.matrix()
now supports converting an igraph graph to an adjacency or edge list matrix representation. See as.matrix.igraph()
for more details. This function was migrated from intergraph
; thanks to Michal Bojanowski.Fixed:
is_connected()
now returns FALSE for the null graphlength()
on a graph now returns the number of vertices to make it consistent with indexing the graph with [[
.diameter()
now corrently returns infinity for disconnected graphs when unconnected=FALSE
. Previous versions returned the number of vertices plus one, which was clearly invalid for weighted graphs.mean_distance()
now correctly treats the path length between disconnected vertices as infinite when unconnected=FALSE
. Previous versions used the number of vertices plus one, adding a bias towards this number, even if the graph was weighted and the number of vertices plus one was not a path length that could safely have been considered as being longer than any “valid” path.layout_with_sugiyama()
now handles the case of exactly one extra virtual node correctly; fixes #85bfs()
and dfs()
callback functions now correctly receive 1-based vertex indices and ranks; it used to be zero-based in earlier versionsbfs()
or dfs()
callback does not crash R any moreprint()
on a graph with a small max.lines
value (smaller than the number of lines needed to print the attribute list and the header) does not raise an error any more; fixes #179as_adjacency_matrix(edges=TRUE, sparse=TRUE)
now consistently returns the last edge ID for each cell in the matrix instead of summing them.+
and -
operators with a path()
object consisting of two vertices is now handled correctly; fixes #355topo_sort()
now throws an error if the input graph is not acyclic instead of returning an incorrect partial ordering.transitivity(mode="barrat")
now throw an error for multigraphs; the implementation does not work correctly for multigraphs and earlier versions did not warn about this.Changed:
neimode
argument of bfs()
and dfs()
was renamed to mode
for sake of consistency with other functions. The old argument name is deprecated and will be removed in 1.4.0.bfs()
and dfs()
callback functions now correctly receive 1-based vertex indices and ranks; it used to be zero-based in earlier versions. (This is actually a bugfix so it’s also mentioned in the “Fixed” section).closeness()
, betweenness()
and edge_betweenness()
now all take a cutoff
argument on their own. estimate_closeness()
, estimate_betweenness()
and estimate_edge_betweenness()
became aliases, with identical signature. They are not deprecated but their implementation might change in future versions to provide proper estimation schemes instead of a simple cutoff-based approximation. If you explicitly need cutoffs and you want your results to be reproducible with future versions, use closeness()
, betweenness()
and edge_betweenness()
in your code with a cutoff
argument.closeness()
now only considers reachable vertices during the calculation; in other words, closeness centrality is now calculated on a per-component basis for disconnected graphs. Earlier versions considered all vertices.Deprecated:
cutoff=0
for closeness()
, betweenness()
and edge_betweenness()
is deprecated; if you want exact scores, use a negative cutoff. cutoff=0
will be interpreted literally from igraph 1.4.0.centr_degree_tmax()
now prints a warning when it is invoked without an explicit loops
argument. loops
will be mandatory from igraph 1.4.0.nexus_list()
, nexus_info()
, nexus_get()
and nexus_search()
functions now return an error informing the user that the Nexus graph repository has been taken offline (actually, several years ago). These functions will be removed in 1.4.0.edges
argument of as_adjacency_matrix()
is deprecated; it will be removed in igraph 1.4.0.Removed:
page_rank_old()
function and the deprecated power
method of page_rank()
were removed.Dec 27, 2021
No user visible changes.
Dec 14, 2021
Fixed:
igraph
were accidentally built without GraphML support on CRAN; this should now be fixed.Nov 22, 2021
No user visible changes.
Oct 26, 2021
No user visible changes.
Oct 15, 2021
The C core is updated to 0.8.5, fixing a range of bugs and introducing a number of new functions.
Added:
Fixed:
make_lattice()
correctly rounds length
to the nearest integer while printing a warning (#115).make_empty_graph(NULL)
now prints an error instead of producing an invalid graph (#404).make_graph(c())
now produces an empty graph instead of printing a misleading error message (#431).types
argument of functions related to bipartite graphs now prints a warning when the types are coerced to booleans (#476).layout_with_sugiyama()
returns a layout of type matrix even if there is only one vertex in the graph (#408).Deprecated:
membership
argument of modularity.matrix()
is now deprecated as the function never needed it anyway.modularity()
now prints a warning when it is applied on a directed graph because the implementation in igraph’s C core does not support directed graphs as of version 0.8.5. The warning will be turned into an error in the next minor (1.3.0) version of the R interface; the error will be removed later when the C core is updated to a version that supports modularity for directed networks.transitivity()
now prints a warning when its local variant (type="local"
) is called on a directed graph or a graph with multiple edges beecause the implementation in the C core of igraph does not work reliably in these cases as of version 0.8.5. The warning will be turned into an error in the next minor (1.3.0) version of the R interface; the error will be removed later when the C core is updated to a version that supports transitivity for networks with multiple edges.Misc:
Oct 5, 2020
No user visible changes.
Mar 27, 2020
No user visible changes.
Feb 13, 2019
No user visible changes.
Jan 27, 2019
No user visible changes.
Jul 27, 2018
No user visible changes.
cluster_optimal()
function does not work. Unfortunately we cannot bundle the GLPK library into igraph on CRAN any more, because CRAN maintainers forbid the pragmas in its source code.Jul 20, 2017
Jul 13, 2017
graph_id
function was addededge_attr
for some index valuesbfs()
bug, restricted
argument was zero-basedmatch_vertices
is exported now%>%
is re-exported in a better way, to avoid interference with other packagesego_
functions default to order = 1
nowigraph_with_opt
to run code with temporary igraph options settingssample_asym_pref
functioncurve_multiple
to avoid warnings for graphs with self-loops.NMF
package is only suggested now, it is not a hard dependencypkgconfig
package for options. This allows setting options on a per-package basis. E.g. a package using igraph can set return.vs.es
to FALSE
in its .onLoad()
function, and then igraph will return plain numeric vectors instead of vertex/edge sequences if called from this package.igraph_options()
returns the old values of the updated options, this is actually useful, returning the new values was not.with_igraph_opt()
function to temporarily change values of igraph options.get.edge()
is deprecated, use ends()
instead. (This was already the case for igraph 1.0.0, but we forgot to add a NEWS point for it.).Call()
, to make native calls faster.anyNA()
call, to be compatible with older R versions.head_of()
and tail_of()
, they were mixed up.label.dist
independent of label lengths, fixes #63.R CMD check
NOTE
s.modularity()
.str.igraph()
to print_all()
.V()
or E()
indexing now begin with a dot. Old names are deprecated. New names: .nei()
, .innei()
, .outnei()
, .inc()
, .from()
, .to()
. #22layout_with_dh
, layout_with_gem
and layout_with_sugiyama
. They crashed in some cases.June 26, 2015
Some minor updates:
June 21, 2015
This is a new major version of igraph, and then why not call it 1.0.0. This does not mean that it is ready, it’ll never be ready.
The biggest changes in the release are - the new function names. Most functions were renamed to make them more consistent and readable. (Relax, old names can still be used, no need to update any code.) - Better operations for vertex and edge sequences. Most functions return proper vertex/edge sequences instead of numeric ids. - The versatile make_()
and make_graph()
functions to create graphs.
make_graph()
function to create graphs.layout_()
(not the underscore!) function to create graph layouts, see also add_layout_()
.upgrade_graph()
on graphs created with previous igraph versions.[[
operator now, for easy viewing of vertex/edge metadata.as_ids()
function to convert them to simple ids.layout_with_dh()
.layout_with_gem()
.mindist
parameter for the smallest distance to consider.all_simple_paths()
function to list all simple paths in a graph.triangles()
lists all triangles in a graph.local_scan()
function calculates scan statistics.embed_adjacency_matrix()
and embed_laplacian_matrix()
.*
, the same graph multiple times. Can be also used as rep()
.random_walk()
adjacent_vertices()
and incident_edges()
functions, they are vectorized, as opposed to neighhors()
and incident()
.as_long_data_frame()
.Too many to list. Please try if your issue was fixed and (re-)report it if not. Thanks!
April 21, 2014
Some bug fixes, to make sure that the code included in ‘Statistical Analysis of Network Data with R’ works. See https://github.com/kolaczyk/sand
l
, not x
, which is for complex attributes. Issue #578.communities
objects, see create.communities()
. Issue #547.constaint()
, issue #580.simplify
argument of graph.formula()
, which was broken, issue #586.crossing()
adds better names to the result, fixes issue #587.sir()
function gives an error if the input graph is not simple, fixes issue #582.February 4, 2014
There are a bunch of new features in the library itself, and other important changes in the life of the project. Thanks everyone for sending code and reporting bugs!
igraph’s development has moved from Launchpad to github. This has actually happened several month ago, but never announced officially. The place for reporting bugs is at https://github.com/igraph/igraph/issues.
igraph’s homepage is now hosted at http://igraph.org, and it is brand new. We wanted to make it easier to use and modern.
You can download nightly builds from igraph at http://igraph.org/nightly. Source and binary R packages (for windows and OSX), are all built.
demo(hrg)
.mod.matrix()
.layout.bipartite()
function, a simple two-column layout for bipartite graphs.barabasi.game()
, algorithm psumtree-multiple just froze.layout.mds()
by default returns a layout matrix now.plot.communities()
(plot.igraph()
, really) draws a border around the marked groups by default.name
graph attribute to charactervertex.attriubutes()
, graph.attributes()
and edge.attributes()
.graph.disjoint.union()
handles attributes now.graph.union()
to handle attributes properly.rewire()
: now supports the generation and destruction of loops.bipartite.random.game()
.get_shortest_paths()
, reorganized the output of get.shortest.paths()
completely.graphlets()
and related functions.bonpow()
and alpha.centrality()
and make sure that the sparse solver is called.tkplot()
news: enable setting coordinates from the command line via tkplot.setcoords()
and access to the canvas via tkplot.canvas()
.igraph_edge_connectivity()
, because of an un-initialized variable in the C code.closeness()
and related functions.bipartite.projection()
.graphNEL
conversion functions only load the ‘graph’ package if it was not loaded before and they load it at the end of the search path, to minimize conflicts.graph.bfs()
and graph.dfs()
.is.chordal()
.centralization.closeness.tmax()
.arpack()
now gives error message if unknown options are given.igraphtest()
function.add.edges()
does not allow now zeros in the vertex set.adjacent.triangles()
.graph.eigen()
function, eigenproblems on adjacency matrices.decompose.graph()
and graph.neighborhood()
use it. Fixes issue #508.optimal.community()
, closes #511.graph.intersection.by.name()
, graph.union.by.name()
, graph.difference.by.name()
.+
operator on graphs now calls graph.union()
if both argument graphs are named, and calls graph.disjoint.union()
otherwise.igraph.version()
.sbm.game()
.set.vertex/edge.attribute
bug that changed both graph objects, after copying (#533)barabasi.game
that caused crashes.'which
argument to bipartite.projection
(#307).normalized
argument to closeness functions, fixes issue #3.[[
on vertex/edge sets, fixes #231.start
argument in hrg.fit
(#225).graph.density
that resulted in incorrect values for undirected graphs with loopsgraph.decompose
), causing #550.graph.adjacency
bugs for graphs with one edge, and graphs with zero edges.graph.adjacency
bug for undirected, weighted graphs and sparse matrices.main
, sub
, xlab
and ylab
are proper graphics parameters now (#555).graph.data.frame
coerces arguments to data frame (#557).sir
function.graph.mincut
and related functions.graph.bfs
(#575).Released Oct 28, 2013
Some bugs fixed:
Released May 16, 2013
Worked two CRAN check problems, and a gfortran bug (string bound checking does not work if code is called from C and without string length arguments at the “right” place).
Otherwise identical to 0.6.5-1.
Released February 27, 2013
Fixing an annoying bug, that broke two other packages on CRAN:
Released February 24, 2013
This is a minor release, to fix some very annoying bugs in 0.6.4:
Released February 2, 2013
The version number is not a mistake, we jump to 0.6.4 from 0.6, for technical reasons. This version was actually never really released, but some R packages of this version were uploaded to CRAN, so we include this version in this NEW file.
Added a vertex shape API for defining new vertex shapes, and also a couple of new vertex shapes.
Added the get.data.frame() function, opposite of graph.data.frame().
Added bipartite support to the Pajek reader and writer, closes bug #1042298.
degree.sequence.game() has a new method now: “simple_no_multiple”.
Added the is.degree.sequence() and is.graphical.degree.sequence() functions.
rewire() has a new method: “loops”, that can create loop edges.
Walktrap community detection now handles isolates.
layout.mds() returns a layout matrix now.
layout.mds() uses LAPACK instead of ARPACK.
Handle the ‘~’ character in write.graph and read.graph. Bug #1066986.
Added k.regular.game().
Use vertex names to plot if no labels are specified in the function call or as vertex attributes. Fixes issue #1085431.
power.law.fit() can now use a C implementation.
Fixed a bug in barabasi.game() when out.seq was an empty vector.
Fixed a bug that made functions with a progress bar fail if called from another package.
Fixed a bug when creating graphs from a weighted integer adjacency matrix via graph.adjacency(). Bug #1019624.
Fixed overflow issues in centralization calculations.
Fixed a minimal.st.separators() bug, some vertex sets were incorrectly reported as separators. Bug #1033045.
Fixed a bug that mishandled vertex colors in VF2 isomorphism functions. Bug #1032819.
Pajek exporter now always quotes strings, thanks to Elena Tea Russo.
Fixed a bug with handling small edge weights in shortest paths calculation in shortest.paths() (Dijkstra’s algorithm.) Thanks to Martin J Reed.
Weighted transitivity uses V(graph) as ‘vids’ if it is NULL.
Fixed a bug when ‘pie’ vertices were drawn together with other vertex shapes.
Speed up printing graphs.
Speed up attribute queries and other basic operations, by avoiding copying of the graph. Bug #1043616.
Fixed a bug in the NCV setting for ARPACK functions. It cannot be bigger than the matrix size.
layout.merge()’s DLA mode has better defaults now.
Fixed a bug in layout.mds() that resulted vertices on top of each other.
Fixed a bug in layout.spring(), it was not working properly.
Fixed layout.svd(), which was completely defunct.
Fixed a bug in layout.graphopt() that caused warnings and on some platforms crashes.
Fixed community.to.membership(). Bug #1022850.
Fixed a graph.incidence() crash if it was called with a non-matrix argument.
Fixed a get.shortest.paths bug, when output was set to “both”.
Motif finding functions return NA for isomorphism classes that are not motifs (i.e. not connected). Fixes bug #1050859.
Fixed get.adjacency() when attr is given, and the attribute has some complex type. Bug #1025799.
Fixed attribute name in graph.adjacency() for dense matrices. Bug #1066952.
Fixed erratic behavior of alpha.centrality().
Fixed igraph indexing, when attr is given. Bug #1073705.
Fixed a bug when calculating the largest cliques of a directed graph. Bug #1073800.
Fixed a bug in the maximal clique search, closes #1074402.
Warn for negative weights when calculating PageRank.
Fixed dense, unweighted graph.adjacency when diag=FALSE. Closes issue #1077425.
Fixed a bug in eccentricity() and radius(), the results were often simply wrong.
Fixed a bug in 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.
Better check for NAs in vertex names. Fixes issue #1087215
Fixed a potential crash in the DrL layout generator.
Fixed a bug in the Reingold-Tilford layout when the graph is directed and mode != ALL.
Released June 11, 2012
See also the release notes at http://igraph.sf.net/relnotes-0.6.html
Released November 22, 2009
Released April 10, 2009
See also the release notes at http://igraph.sf.net/relnotes-0.5.2.html
Released July 14, 2008
See also the release notes at http://igraph.sf.net/relnotes-0.5.1.html
Released February 14, 2008
See also the release notes at http://igraph.sf.net/relnotes-0.5.html
The ‘rescale’, ‘asp’ and ‘frame’ graphical parameters were added
Create graphs from a formula notation (graph.formula)
Handle graph attributes properly
Calculate the actual minimum cut for undirected graphs
Adjacency lists, get.adjlist and get.adjedgelist added
Eigenvector centrality computation is much faster now
Proper R warnings, instead of writing the warning to the terminal
R checks graphical parameters now, the unknown ones are not just ignored, but an error message is given
plot.igraph has an ‘add’ argument now to compose plots with multiple graphs
plot.igraph supports the ‘main’ and ‘sub’ arguments
layout.norm is public now, it can normalize a layout
It is possible to supply startup positions to layout generators
Always free memory when CTRL+C/ESC is pressed, in all operating systems
plot.igraph can plot square vertices now, see the ‘shape’ parameter
graph.adjacency rewritten when creating weighted graphs
We use match.arg whenever possible. This means that character scalar options can be abbreviated and they are always case insensitive
VF2 graph isomorphism routines can check subgraph isomorphism now, and they are able to return matching(s)
The BLISS graph isomorphism algorithm is included in igraph now. See canonical.permutation, graph.isomorphic.bliss
We use ARPACK for eigenvalue/eigenvector calculation. This means that the following functions were rewritten: page.rank, leading.eigenvector.community.*, evcent. New functions based on ARPACK: hub.score, authority.score, arpack.
Edge weights for Fruchterman-Reingold layout (layout.fruchterman.reingold).
Line graph calculation (line.graph)
Kautz and de Bruijn graph generators (graph.kautz, graph.de.bruijn)
Support for writing graphs in DOT format
Jaccard and Dice similarity coefficients added (similarity.jaccard, similarity.dice)
Counting the multiplicity of edges (count.multiple)
The graphopt layout algorithm was added, layout.graphopt
Generation of “famous” graphs (graph.famous).
Create graphs from LCF notation (graph.cf).
Dyad census and triad cencus functions (dyad.census, triad.census)
Cheking for simple graphs (is.simple)
Create full citation networks (graph.full.citation)
Create a histogram of path lengths (path.length.hist)
Forest fire model added (forest.fire.game)
DIMACS reader can handle different file types now
Biconnected components and articulation points (biconnected.components, articulation.points)
Kleinberg’s hub and authority scores (hub.score, authority.score)
as.undirected handles attributes now
Geometric random graph generator (grg.game) can return the coordinates of the vertices
Function added to convert leading eigenvector community structure result to a membership vector (community.le.to.membership)
Weighted fast greedy community detection
Weighted page rank calculation
Functions for estimating closeness, betweenness, edge betweenness by introducing a cutoff for path lengths (closeness.estimate, betweenness.estimate, edge.betweenness.estimate)
Weighted modularity calculation
Function for permuting vertices (permute.vertices)
Betweenness and closeness calculations are speeded up
read.graph can handle all possible line terminators now ( , ,
Error handling was rewritten for walktrap community detection, the calculation can be interrupted now
The maxflow/mincut functions allow to supply NULL pointer for edge capacities, implying unit capacities for all edges
Released January 1, 2008
New: - Cohesive block finding in the R interface, thanks to Peter McMahan for contributing his code. See James Moody and Douglas R. White, 2003, in Structural Cohesion and Embeddedness: A Hierarchical Conception of Social Groups American Sociological Review 68(1):1-25 - Biconnected components and articulation points. - R interface: better printing of attributes. - R interface: graph attributes can be used via ‘$’.
Bug fixed: - Erdos-Renyi random graph generators rewritten.
Released October 3, 2007
This release should work seamlessly with the new R 2.6.0 version. Some other bugs were also fixed: - A bug was fixed in the Erdos-Renyi graph generator, which sometimes added an extra vertex.
Released August 13, 2007
The next one in the sequence of bugfix releases. Thanks to many people sending bug reports. Here are the changes: - Some memory leaks removed when using attributes from R or Python. - GraphML parser: entities and character data in multiple chunks are now handled correctly. - A bug corrected in edge betweenness community structure detection, it failed if called many times from the same program/session. - Edge betweeness community structure: handle unconnected graphs properly. - Fixed bug related to fast greedy community detection in unconnected graphs. - Use a different kind of parser (Push) for reading GraphML files. This is almost invisible for users but fixed a nondeterministic bug when reading in GraphML files. - R interface: plot now handles properly if called with a vector as the edge.width argument for directed graphs. - R interface: bug (typo) corrected for walktrap.community and weighted graphs.
Released June 7, 2007
This is another bugfix release, as there was a serious bug in the R package of the previous version: it could not read and write graphs to files in any format under MS Windows.
Some other bits added: - circular Reingold-Tilford layout generator for trees - corrected a bug, Pajek files are written properly under MS Windows now. - arrow.size graphical edge parameter added in the R interface.
Released May 23, 2007
This is a minor release, it corrects a number of bugs, mostly in the R package.
Released May 21, 2007
The major new additions in this release is a bunch of community detection algorithms and support for the GML file format. Here is the complete list of changes:
as the internal representation changed, graphs stored with ‘save’ with an older igraph version cannot be read back with the new version reliably.
neighbors returns ordered lists
is.loop and is.multiple were added
topological sorting
VF2 isomorphism algorithm
support for reading graphs from the Graph Database for isomorphism
graph.mincut can calculate the actual minimum cut
girth calculation added, thanks to Keith Briggs
support for reading and writing GML files
Walktrap community detection algorithm added, thanks to Matthieu Latapy and Pascal Pons
edge betweenness based community detection algorithm added
fast greedy algorithm for community detection by Clauset et al. added thanks to Aaron Clauset for sharing his code
leading eigenvector community detection algorithm by Mark Newman added
functions for creating dendrograms from the output of the community detection algorithms added
community.membership supporting function added, creates a membership vector from a community structure merge tree
modularity calculation added
graphics parameter handling is completely rewritten, uniform handling of colors and fonts, make sure you read ?igraph.plotting
new plotting parameter for edges: arrow.mode
a bug corrected when playing a nonlinear barabasi.game
better looking plotting in 3d using rglplot: edges are 3d too
rglplot layout is allowed to be two dimensional now
rglplot suspends updates while drawing, this makes it faster
loop edges are correctly plotted by all three plotting functions
better printing of attributes when printing graphs
summary of a graph prints attribute names
is.igraph rewritten to make it possible to inherit from the ‘igraph’ class
somewhat better looking progress meter for functions which support it
Released Dec 19, 2006
This is a new major release, it contains many new things:
Released Aug 23, 2006
This is a bug-fix release. Bugs fixed: - reciprocity corrected to avoid segfaults - some docs updates - various R package updates to make it conform to the CRAN rules
Released Aug 18, 2006
Release time at last! There are many new things in igraph 0.2, the most important ones: - reading writing Pajek and GraphML formats with attributes (not all Pajek and GraphML files are supported, see documentation for details) - the RANDEDU fast motif search algorithm is implemented - many new graph generators, both games and regular graphs - many new structural properties: transitivity, reciprocity, etc. - graph operators: union, intersection, difference, structural holes, etc. - conversion between directed and undirected graphs - new layout algorithms for trees and large graphs, 3D layouts and many more.
New things specifically in the R package: - support for CTRL+C - new functions: Graph Laplacian, Burt’s constraint, etc. - vertex/edge sequences totally rewritten, smart indexing (see manual) - new R manual and tutorial: `Network Analysis with igraph’, still under development but useful - very basic 3D plotting using OpenGL
Although this release was somewhat tested on Linux, MS Windows, Mac OSX, Solaris 8 and FreeBSD, no heavy testing was done, so it might contain bugs, and we kindly ask you to send bug reports to make igraph better.
Released Jan 30, 2006
After about a year of development this is the first “official” release of the igraph library. This release should be considered as beta software, but it should be useful in general. Please send your questions and comments.