From 560933e0b471dad454409d265e2c9e3020109aef Mon Sep 17 00:00:00 2001 From: Bas Dirks Date: Mon, 1 Apr 2024 12:00:30 +0200 Subject: [PATCH] release: 0.3.1 - Update function names in `README`. --- CHANGELOG.md | 6 ++++++ Cargo.lock | 2 +- Cargo.toml | 2 +- README.md | 13 ++++--------- 4 files changed, 12 insertions(+), 11 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 4fff3bf..6c4c117 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,5 +1,11 @@ # Changelog +## [0.3.1] - 2024-04-01 + +### Changed + +- Update function names in `README`. + ## [0.3.0] - 2024-04-01 ### Added diff --git a/Cargo.lock b/Cargo.lock index d631dcf..00a5116 100644 --- a/Cargo.lock +++ b/Cargo.lock @@ -89,7 +89,7 @@ dependencies = [ [[package]] name = "graaf" -version = "0.3.0" +version = "0.3.1" dependencies = [ "divan", ] diff --git a/Cargo.toml b/Cargo.toml index 708aefe..061b5d8 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -1,6 +1,6 @@ [package] name = "graaf" -version = "0.3.0" +version = "0.3.1" edition = "2021" license = "Apache-2.0" description = "Functions and types for working with graphs" diff --git a/README.md b/README.md index 8b104ef..c81ef8a 100644 --- a/README.md +++ b/README.md @@ -12,15 +12,10 @@ This crate builds on `nightly`. This will change in version `1.0.0`. ## Algorithms -### Single-source shortest paths - -- `dijkstra_sssp_unweighted` for unweighted directed graphs -- `dijkstra_sssp_weighted` for weighted directed graphs - -### Multiple sources shortest paths - -- `Unweighted.dijkstra` for unweighted directed graphs -- `Weighted.dijkstra` for weighted directed graphs +- `algo::dijkstra::unweighted::min_distances` calculates the minimum distances from multiple source vertices to all other vertices in an unweighted directed graph. +- `algo::dijkstra::weighted::min_distances` calculates the minimum distances from multiple source vertices to all other vertices in a weighted directed graph. +- `algo::dijkstra::unweighted::min_distances_single_source` calculates the minimum distances from the source vertex to all other vertices in an unweighted graph. +- `algo::dijkstra::weighted::min_distances_single_source` calculates the minimum distances from the source vertex to all other vertices in a weighted graph. ## Graph operation traits