v0.11.16

Corrected Louvain resolution parameter behaviour.

v0.11.15

Added weighted parameter to group betweenness centrality.
Fixed inconsistencies between graphrs and NetworkX group centrality calculations.

v0.11.14

Added group centrality functions.

v0.11.13

Merged pull requests from Maurice Kayser:

• Fix line break in error message string
• Feature-gate lapack.lib

v0.11.12

New Leiden community detection algorithm (unoptimized).
Added boundary and cuts modules to support Leiden.
Fixed a bug in fast_gnp_random_graph undirected.
Made clustering for directed weighted use into_par_iter.

v0.11.11

Fixed bug with directed graphs in Louvain community detection.
Corrected karate club graph weights.
Fixed bug in graph creation where self-loop edges get added to adjacency vecs multiple times.
Put spectral_gap behind the "adjacency_matrix" feature.

v0.11.8

Added resiliency::average_node_betweenness.

v0.11.6

Added a algorithms::resiliency module to with a spectral_gap function.
Expanded the ability to get adjacency matrices with new Graph methods:

• get_adjacency_matrix_vec
• get_adjacency_matrix_vec_vec
• get_adjacency_matrix_nalgebra
• get_adjacency_matrix_ndarray
• get_adjacency_matrix_sprs

To use the nalgebra, ndarray or sprs methods you must enable the "adjacency_matrix" feature in Cargo.toml:
graphrs = { version = "x.y.z", features = ["adjacency_matrix"] }

v0.11.5

Added get_adjacency_matrix and to_undirected methods to Graph.
Corrected incorrect weight in karate club graph.

v0.11.4

added constraint module