[package]
edition = "2024"
name = "sinistra"
version = "0.1.0-202603071957"
authors = ["Buğra Kadirhan <bugrakadirhan@proton.me>"]
build = false
autolib = false
autobins = false
autoexamples = false
autotests = false
autobenches = false
description = "A generic graph framework with pluggable storage and topology and streaming graph algorithms."
documentation = "https://docs.rs/sinistra"
readme = "README.md"
keywords = [
"graph",
"graph-algorithms",
"bfs",
"dfs",
"dijkstra",
]
categories = [
"algorithms",
"data-structures",
]
license = "MIT"
repository = "https://github.com/wintermarstice/sinistra"
[lib]
name = "sinistra"
path = "src/lib.rs"
[[example]]
name = "basic_graph"
path = "examples/basic_graph.rs"
[[example]]
name = "bfs_distances"
path = "examples/bfs_distances.rs"
[[example]]
name = "dfs_events"
path = "examples/dfs_events.rs"
[[example]]
name = "dijkstra_cities"
path = "examples/dijkstra_cities.rs"
[[example]]
name = "dijkstra_distances"
path = "examples/dijkstra_distances.rs"
[[test]]
name = "graph_basics"
path = "tests/graph_basics.rs"
[[test]]
name = "new_traversals"
path = "tests/new_traversals.rs"
[[test]]
name = "traversal_algorithms"
path = "tests/traversal_algorithms.rs"
[[test]]
name = "visit_maps"
path = "tests/visit_maps.rs"
[dependencies]