Permalink
Browse files

Removed old NEWS files, it's all in NEWS now.

  • Loading branch information...
1 parent 1c853c8 commit aa3dff2ccdce0f3ecc94f90516b895b7353d2015 @gaborcsardi gaborcsardi committed Nov 12, 2013
Showing with 51 additions and 392 deletions.
  1. +51 −0 NEWS
  2. +0 −95 NEWS-0.3
  3. +0 −46 NEWS-0.3.3
  4. +0 −80 NEWS-0.4
  5. +0 −171 NEWS-0.5
View
@@ -1206,6 +1206,57 @@ deb http://cneurocvs.rmki.kfki.hu /packages/binary/
deb-src http://cneurocvs.rmki.kfki.hu /packages/source/
+igraph 0.3.3
+============
+
+Released February 28, 2007
+
+New in the C library
+--------------------
+
+* igraph_connect_neighborhood, nomen est omen
+* igraph_watts_strogatz_game and igraph_rewire_edges
+* K-core decomposition: igraph_coreness
+* Clique and independent vertex set related functions:
+ igraph_cliques, igraph_independent_vertex_sets,
+ igraph_maximal_cliques, igraph_maximal_independent_vertex_sets,
+ igraph_independence_number, igraph_clique_number,
+ Some of these function were ported from the very_nauty library
+ of Keith Briggs, thanks Keith!
+* The GraphML file format now supports graph attributes
+* Transitivity calculation speeded up
+* Correct transitivity calculation for multigraphs (ie. non-simple graphs)
+
+New in the R interface
+----------------------
+
+* connect.neighborhood
+* watts.strogatz.game and rewire.edges
+* K-core decomposition: graph.coreness
+* added the 'innei' and 'outnei' shorthands for vertex sequence indexing
+ see help(iterators)
+* Clique and independent vertex set related functions:
+ cliques, largest.cliques, maximal.cliques, clique.number,
+ independent.vertex.sets, largest.independent.vertex.sets,
+ maximal.independent.vertex.sets, independence.number
+* The GraphML file format now supports graph attributes
+* edge.lty argument added to plot.igraph and tkplot
+* Transitivity calculation speeded up
+* Correct transitivity calculation for multigraphs (ie. non-simple graphs)
+* alpha.centrality added, calculates Bonacich alpha centrality, see docs.
+
+Bugs corrected
+--------------
+
+* 'make install' installs the library correctly on Cygwin now
+* Pajek parser corrected to read files with MacOS newline characters correctly
+* overflow bug in transitivity calculation for large graphs corrected
+* an internal memcpy/memmove bug causing some segfaults removed
+* R interface: tkplot bug with graphs containing a 'name' attribute
+* R interface: attribute handling bug when adding vertices
+* R interface: color selection bug corrected
+* R interface: plot.igraph when plotting loops
+
Python interface documentation
====================
View
@@ -1,95 +0,0 @@
-
-Changes in the C library
-------------------------
-
-* igraph_maxdegree added, calculates the maximum degree in the graph
-* igraph_grg_game, geometric random graphs
-* igraph_density, graph density calculation
-* push-relabel maximum flow algorithm added, igraph_maxflow_value
-* minimum cut functions added based on maximum flow:
- igraph_st_mincut_value, igraph_mincut_value, the Stoer-Wagner
- algorithm is implemented for undirected graphs
-* vertex connectivity functions, usually based on maximum flow:
- igraph_st_vertex_connectivity, igraph_vertex_connectivity
-* edge connectivity functions, usually based on maximum flow:
- igraph_st_edge_connectivity, igraph_edge_connectivity
-* other functions based on maximum flow: igraph_edge_disjoint_paths,
- igraph_vertex_disjoint_paths, igraph_adhesion, igraph_cohesion
-* dimacs file format added
-* igraph_to_directed handles attributes
-* igraph_constraint calculation corrected, it handles weighted graphs
-* spinglass-based community structure detection, the Joerg Reichardt --
- Stefan Bornholdt algorithm added: igraph_spinglass_community,
- igraph_spinglass_my_community
-* igraph_extended_chordal_rings, it creates extended chordal rings
-* 'no' argument added to igraph_clusters, it is possible to calculate
- the number of clusters without calculating the clusters themselves
-* minimum spanning tree functions keep attributes now and also the
- direction of the edges is kept in directed graphs
-* there are separate functions to calculate different types of
- transitivity now
-* igraph_delete_vertices rewritten to allocate less memory for the new
- graph
-* neighborhood related functions added: igraph_neighborhood,
- igraph_neighborhood_size, igraph_neighborhood_graphs
-* two new games added based on different node types:
- igraph_preference_game and igraph_asymmetric_preference_game
-* Laplacian of a graph can be calculated by the igraph_laplacian function
-
-Changes in the R interface
---------------------------
-
-* bonpow function ported from SNA to calculate Bonacich power centrality
-* get.adjacency supports attributes now, this means that it sets the
- colnames and rownames attributes and can return attribute values in
- the matrix instead of 0/1
-* grg.game, geometric random graphs
-* graph.density, graph density calculation
-* edge and vertex attributes can be added easily now when added new
- edges with add.edges or new vertices with add.vertices
-* graph.data.frame creates graph from data frames, this can be used to
- create graphs with edge attributes easily
-* plot.igraph and tkplot can plot self-loop edges now
-* graph.edgelist to create a graph from an edge list, can also handle
- edge lists with symbolic names
-* get.edgelist has now a 'names' argument and can return symbolic
- vertex names instead of vertex ids, by default id uses the 'name'
- vertex attribute is returned
-* printing graphs on screen also prints symbolic symbolic names
- (the 'name' attribute if present)
-* maximum flow and minimum cut functions: graph.maxflow, graph.mincut
-* vertex and edge connectivity: edge.connectivity, vertex.connectivity
-* edge and vertex disjoint paths: edge.disjoint.paths,
- vertex.disjoint.paths
-* White's cohesion and adhesion measure: graph.adhesion, graph.cohesion
-* dimacs file format added
-* as.directed handles attributes now
-* constraint corrected, it handles weighted graphs as well now
-* weighted attribute to graph.adjacency
-* spinglass-based community structure detection, the Joerg Reichardt --
- Stefan Bornholdt algorithm added: spinglass.community
-* graph.extended.chordal.ring, extended chordal ring generation
-* no.clusters calculates the number of clusters without calculating
- the clusters themselves
-* minimum spanning tree functions updated to keep attributes
-* transitivity can calculate local transitivity as well
-* neighborhood related functions added: neighborhood,
- neighborhood.size, graph.neighborhood
-* new graph generators based on vertex types: preference.game and
- asymmetric.preference.game
-
-Bugs corrected
---------------
-
-* attribute handling bug when deleting edges corrected
-* GraphML escaping and NaN handling corrected
-* bug corrected to make it possible compile the R package without the
- libxml2 library
-* a bug in Erdos-Renyi graph generation corrected: it had problems
- with generating large directed graphs
-* bug in constraint calculation corrected, it works well now
-* fixed memory leaks in igraph_read_graph_graphml
-* error handling bug corrected in igraph_read_graph_graphml
-* bug corrected in R version of graph.laplacian when normalized
- Laplacian is requested
-* memory leak corrected in get.all.shortest.paths in the R package
View
@@ -1,46 +0,0 @@
-
-New in the C library
---------------------
-
-* igraph_connect_neighborhood, nomen est omen
-* igraph_watts_strogatz_game and igraph_rewire_edges
-* K-core decomposition: igraph_coreness
-* Clique and independent vertex set related functions:
- igraph_cliques, igraph_independent_vertex_sets,
- igraph_maximal_cliques, igraph_maximal_independent_vertex_sets,
- igraph_independence_number, igraph_clique_number,
- Some of these function were ported from the very_nauty library
- of Keith Briggs, thanks Keith!
-* The GraphML file format now supports graph attributes
-* Transitivity calculation speeded up
-* Correct transitivity calculation for multigraphs (ie. non-simple graphs)
-
-New in the R interface
-----------------------
-
-* connect.neighborhood
-* watts.strogatz.game and rewire.edges
-* K-core decomposition: graph.coreness
-* added the 'innei' and 'outnei' shorthands for vertex sequence indexing
- see help(iterators)
-* Clique and independent vertex set related functions:
- cliques, largest.cliques, maximal.cliques, clique.number,
- independent.vertex.sets, largest.independent.vertex.sets,
- maximal.independent.vertex.sets, independence.number
-* The GraphML file format now supports graph attributes
-* edge.lty argument added to plot.igraph and tkplot
-* Transitivity calculation speeded up
-* Correct transitivity calculation for multigraphs (ie. non-simple graphs)
-* alpha.centrality added, calculates Bonacich alpha centrality, see docs.
-
-Bugs corrected
---------------
-
-* 'make install' installs the library correctly on Cygwin now
-* Pajek parser corrected to read files with MacOS newline characters correctly
-* overflow bug in transitivity calculation for large graphs corrected
-* an internal memcpy/memmove bug causing some segfaults removed
-* R interface: tkplot bug with graphs containing a 'name' attribute
-* R interface: attribute handling bug when adding vertices
-* R interface: color selection bug corrected
-* R interface: plot.igraph when plotting loops
View
@@ -1,80 +0,0 @@
-
-New in the C library
---------------------
-
-* internal representation changed
-* neighbors always returns an ordered list
-* igraph_is_loop and igraph_is_multiple added
-
-* topological sorting
-* VF2 isomorphism algorithm
-* support for reading the file format of the Graph Database for isomorphism
-* igraph_mincut cat 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
-* igraph_community_to_membership supporting function added, creates
- a membership vector from a community structure merge tree
-* modularity calculation added
-
-New in the R interface
-----------------------
-
-* 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
-
-* topological sorting
-* VF2 isomorphism algorithm
-* support for reading graphs from the Graph Database for isomorphism
-* 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 denrdograms 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
-
-Others
-------
-
-* proper support for Debian packages (re)added
-* many functions benefit from the new internal representation and are
- faster now: transitivity, reciprocity, graph operator functions like
- intersection and union, etc.
-* igraph compiles with Microsoft Visual C++ now
-* there were some internal changes to make igraph a real graph algorithm
- platform in the near future, but these are undocumented now
-
-Bugs corrected
---------------
-
-* corrected a bug when reading Pajek files: directed graphs were read as undirected
Oops, something went wrong.

0 comments on commit aa3dff2

Please sign in to comment.