graphalgs 0.0.5

Graph algorithms based on the Rust 'petgraph' library.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

# graphalgs


* [Documentation](https://docs.rs/graphalgs/)
* [Crate](https://crates.io/crates/graphalgs)


## Description


Graph algorithms based on the Rust "petgraph" library.


## Relevance


```petgraph``` is a great tool for working with graphs in ```Rust```, but not all algorithms make sense to put there, so the ```graphalgs``` library will be a repository for a variety of algorithms implemented on the basis of ```petgraph```.


## What's new


1. Algorithms for generating random undirected graphs (weighted and unweighted versions) were added.
2. The following algorithms for solving the shortest path problems have been implemented:
    * SPFA
    * Johnson's algorithm
    * Seidel's algorithm
3. Nalgebra updated to version "0.25.1".

## Usage


As a library
```rust
extern crate graphalgs;

```

If you have any comments or suggestions, or you suddenly found an error, please start a new issue or pool request.