xgraph 2.1.0

A comprehensive Rust library providing efficient graph algorithms for solving real-world problems in social network analysis, transportation optimization, recommendation systems, and more
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

use criterion::{criterion_group, criterion_main, Criterion};
use xgraph::graph::graph::Graph;

fn benchmark_graph_creation(c: &mut Criterion) {
    c.bench_function("create graph with 1000 nodes", |b| {
        let mut graph = Graph::<u32, usize, ()>::new(false);
        b.iter(|| {
            for i in 0..1000 {
                graph.add_node(i);
            }
        });
    });

    c.bench_function("create graph with 1000 nodes and edges", |b| {
        let mut graph = Graph::<u32, usize, ()>::new(false);
        b.iter(|| {
            for i in 0..1000 {
                graph.add_node(i);
                if i > 0 {
                    let _ = graph.add_edge(i - 1, i, 1, ());
                }
            }
        });
    });
}

criterion_group!(graph_benchmarks, benchmark_graph_creation);
criterion_main!(graph_benchmarks);