edgewise 0.1.0

A simple graph library with BFS, DFS, Dijkstra, and random graph generation.
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

## edgewise

**edgewise** is a lightweight and ergonomic Rust 🦀 library for working with graphs.

It provides:
- A simple adjacency-list graph structure
- Random graph generation ((un)weighted, (un)directed)
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra’s shortest-path algorithm

### Example

```rust
use edgewise::{Graph, Weighted};

let g = Graph::new(vec![
    vec![(1, Weighted(4)), (2, Weighted(1))],
    vec![(3, Weighted(1))],
    vec![(1, Weighted(2))],
    vec![],
]);

let distances = g.dijkstra(0)?;
println!("{:?}", distances);
```

### Installation

```toml
[dependencies]
edgewise = "0.1"
```

### License

MIT or Apache-2.0