weighted_path 0.6.0

A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations
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

# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
#
# When uploading crates to the registry Cargo will automatically
# "normalize" Cargo.toml files for maximal compatibility
# with all versions of Cargo and also rewrite `path` dependencies
# to registry (e.g., crates.io) dependencies.
#
# If you are reading this file be aware that the original Cargo.toml
# will likely look very different (and much more reasonable).
# See Cargo.toml.orig for the original contents.

[package]
edition = "2024"
name = "weighted_path"
version = "0.6.0"
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "A Rust library for finding shortest paths in weighted graphs using Dijkstra's algorithm with multiple heap implementations"
readme = "README.md"
keywords = [
    "dijkstra",
    "shortest-path",
    "graph",
    "priority-queue",
    "heap",
]
categories = [
    "algorithms",
    "data-structures",
]
license = "MIT"
repository = "https://github.com/maurolacy/weighted-path"

[lib]
name = "weighted_path"
path = "src/lib.rs"

[[bin]]
name = "generate_graph"
path = "src/generate_graph.rs"

[[bin]]
name = "weighted_path"
path = "src/main.rs"

[[bench]]
name = "dijkstra_bench"
path = "benches/dijkstra_bench.rs"
harness = false

[dependencies.fastrand]
version = "2.0"

[dev-dependencies.criterion]
version = "0.5"
features = ["html_reports"]