para-graph 0.1.2

"Para-Graph" delivers swift, parallel graph algorithms in Rust, optimized for CPU and GPU. Ideal for HPC workflows.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

use itertools::Itertools;
use petgraph::graph::UnGraph;
use petgraph::prelude::EdgeRef;

pub fn get_adj_matrix<N>(graph: &UnGraph<N, f64>) -> Vec<Vec<f64>> {
    let n = graph.node_count();
    let mut mat: Vec<f64> = vec![f64::INFINITY; n * n];
    for i in 0..n {
        mat[i * n + i] = 0.;
    }
    for e in graph.edge_references() {
        let u = e.source().index();
        let v = e.target().index();
        let w = *e.weight();
        mat[u * n + v] = w;
        mat[v * n + u] = w;
    }
    mat.chunks_exact(n).map(|v| v.to_vec()).collect_vec()
}