Erdos.jl v0.5.0

• add constructors EdgeMap(g, e -> f(e)) and VertexMap(g, v->f(v))
• add sort for edges
• add size(emap) for edge map emap returning (nv(g), nv(g))
• add Vector(vmap)
• fix bug in has_edge throwing error in some corner cases
• add contract! method
• add rem_vertices!(g, v1, v2, ....)
• rem_vertices! now returns a vertex map of the reindexed vertices instead of a vector of length nv(g)
• fix docs deploy

Erdos 0.4

• faster constructor from matrix. Also add the possibility to select only the upper triangular and/or the non-diagonal part.
• fix a bug with DiGraph() constructor returning a Graph(0,0).
• EdgeMap(g, m) for matrix argument m now uses only the upper triangular part
  of m if g is an undirected graph.
• add edgemap2adjlist
• crosspath(n, g) -> crosspath(g, n)
• conform indexing of cartesian_product(g,h) and tensor_product(g,h) to julia indexing for matrices:
  • before: id(i,j) = (i-1)*nv(h) + nv(g)
  • after: id(i,j) = i + (j-1)*nv(g)
• add sparse method to convert and edge map to a sparse matrix
• add Matrix method to convert and edge map to a matrix

Erdos 0.3

• is_cyclic(g) -> has_cycles(g). Also it was basically not working for undirected graphs, fixed now.
• add is_tree(g)
• vprop(g, v) and eprop(g, e) return a dictionary containing the properties
  of vertex v and edge e respectively.
• Improved support for gexf format. Now vertex/edge properties can be
  exported and inported with writenetwork and readnetwork.
• add methods has_eprop(g, name, e) and has_vprop(g, name, v)
• internal implementation of .gml parser. Dropped dependence on unmaintained ParserCombinator.jl package.
• Dropping .dot support until implementation of an internal parser.
• fixed all julia 0.6 deprecations
• Remove hack in matching with floating point: now using floating point compiled version
  of BlossomV.

Networks (graph with properties)

• Defined Abstract Network types and interfaces. Networks are graphs with properties. Properties can be associated to vertices, edges or the graph itself
• Implemented two default network types: Network and DiNetwork.
  Internally they are the GTGraph and GTDiGraph of previous versions,
  with the addition of a member of the newly defined type PropertyStore.
• readnetwork and writenetwork can read/write graph and graph/vertex/edge/properties to and from some graph file formats:
  .gt, .graphml, .gml
• subnetwork is the analogue of subgraph method and preserves vertex/edge properties
• improvements to the EdgeMap type and interface
• more efficient remove_vertex and swap_vertices
• add_edge! now returns (ok, new_edge) instead of just ok
• VertexMap is now its own type

Datasets

• doc system updates
• release datasets under GPLv3
• interface with graph collection (datasets) through readgraph
• move testsets into files

Erdos.jl v0.1.2

Changes from v0.1.0 :

• read/write consistency: make sure that writegraph("file",g); g == readgraph("file")
• fixed some bugs in gml, net and dot I/O formats
• fix julia 0.6 deprecations
• update REQUIRE, README and docs

update for julia 0.6

v0.1.1

dates in changelog