All notable changes to this project will be documented in this file.
The format is based on Keep a Changelog, and this project adheres to Semantic Versioning.
- Split betweeness and closeness computation into separate functions.
- Multi-threaded computation of betweenness and closeness metrics.
- Methods to return the unfiltered or filtered adjacency lists have been added to the public API.
- The
graph!
macro for testing purposes.
- Betweenness and closeness metrics have their own methods in the public API.
Agraph
andVertex
types have been removed, betweenness and closeness are computed from the adjacency matrix.
- Bump
nalgebra
tov0.32
.
- Removed test data from the included files in the package.
- Added
AGraph
andVertex
types. - Added
Graph::compute_betweenness_and_closeness
based on theAGraph
.
- Update
nalgebra
to0.31
. - Change
BTreeMap
toHashMap
for centrality measurement collections.
- Create the P2P topology example (
./examples/p2p.rs
). - Introduce
Graph::insert_subset
andGraph::update_subset
.
- Manually implement
Default
forGraph
.
- Clear internal cache on
Graph::remove
.