Graph Algorithms
in Pure Rust

use rust_igraph::{Graph, pagerank, louvain};

fn main() {
    let g = Graph::from_edges(
        &[(0,1), (1,2), (2,0), (2,3), (3,4), (4,5), (5,3)],
        false, None
    ).unwrap();

    // Centrality analysis
    let pr = pagerank(&g).unwrap();
    println!("PageRank: {:?}", pr);

    // Community detection
    let communities = louvain(&g).unwrap();
    println!("Modularity: {:.4}", communities.modularity);
}

use rust_igraph::Graph;

let g = Graph::erdos_renyi(1000, 0.01, 42).unwrap();

// Structural queries
assert!(g.is_connected().unwrap());
println!("Diameter: {:?}", g.diameter().unwrap());
println!("Triangles: {}", g.count_triangles().unwrap());

// Centrality & community
let pr = g.pagerank().unwrap();
let communities = g.louvain().unwrap();

// Graph algebra
let a = Graph::from_edges(&[(0,1)], false, None).unwrap();
let b = Graph::from_edges(&[(1,2)], false, None).unwrap();
let union = &a | &b; // edge union