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

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

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

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

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

[dependencies]
fastrand = "2.0"

[dev-dependencies]
criterion = { version = "0.5", features = ["html_reports"] }

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