para-graph 0.1.2

"Para-Graph" delivers swift, parallel graph algorithms in Rust, optimized for CPU and GPU. Ideal for HPC workflows.
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

[[bench]]
harness = false
name = "floyd_warshall"

[[bench]]
harness = false
name = "radix_sort"

[[bench]]
harness = false
name = "binary_search"

[[bench]]
harness = false
name = "gaussian_elimination"

[[bench]]
harness = false
name = "prefix_sum"

[build-dependencies.cxx-build]
version = "1.0"

[dependencies.cc]
version = "1.0.83"

[dependencies.cxx]
version = "1.0"

[dependencies.itertools]
version = "0.12.1"

[dependencies.log]
version = "0.4.20"

[dependencies.num]
features = ["num-bigint"]
version = "0.4.2"

[dependencies.ordered-float]
version = "4.2.0"

[dependencies.petgraph]
features = ["serde"]
version = "0.6.4"

[dependencies.rand]
version = "0.8.5"

[dependencies.rayon]
version = "1.8.0"

[dev-dependencies.criterion]
version = "0.5.1"

[package]
authors = ["Eliton Machado <elitonmachadod200@gmail.com>"]
description = '"Para-Graph" delivers swift, parallel graph algorithms in Rust, optimized for CPU and GPU. Ideal for HPC workflows.'
edition = "2021"
license = "MIT"
name = "para-graph"
readme = "README.md"
repository = "https://github.com/EMachad0/Para-Graph"
version = "0.1.2"