graph-force/src/lib.rs

53 lines
1.5 KiB
Rust
Raw Normal View History

2022-11-20 16:09:39 +00:00
mod graph;
2022-11-20 19:28:23 +00:00
mod model;
mod runner;
2022-11-20 14:18:06 +00:00
mod spring_model;
2022-11-20 16:09:39 +00:00
mod utils;
2022-11-20 14:18:06 +00:00
2022-11-20 19:28:23 +00:00
use std::sync::{Arc, RwLock};
use pyo3::exceptions;
use pyo3::{prelude::*, types::PyIterator};
2022-11-20 13:49:43 +00:00
2022-11-20 16:09:39 +00:00
#[pyfunction(number_of_nodes, edges, "*", iter = 500, threads = 0)]
fn layout_from_edge_list(
number_of_nodes: usize,
edges: &PyAny,
2022-11-20 16:09:39 +00:00
iter: usize,
threads: usize,
) -> PyResult<Vec<(f32, f32)>> {
2022-11-20 19:28:23 +00:00
let model = Arc::new(RwLock::new(spring_model::SimpleSpringModel::new(1.0)));
let mut edge_matrix = graph::new_edge_matrix(number_of_nodes);
match edges.extract::<&PyIterator>() {
Ok(iter) => {
for edge in iter {
let edge = edge?;
let edge = edge.extract::<(usize, usize)>()?;
graph::add_edge(&mut edge_matrix, edge.0, edge.1);
}
}
Err(_) => match edges.extract::<Vec<(usize, usize)>>() {
Ok(edge) => {
for edge in edge {
graph::add_edge(&mut edge_matrix, edge.0, edge.1);
}
}
Err(_) => {
return Err(PyErr::new::<exceptions::PyTypeError, _>(
"Edges must be an iterable of (int, int)",
));
}
},
}
let r = runner::Runner::new(iter, threads);
Ok(r.layout(number_of_nodes, edge_matrix, model))
2022-11-20 13:49:43 +00:00
}
#[pymodule]
2022-11-20 14:18:06 +00:00
fn graph_force(_py: Python, m: &PyModule) -> PyResult<()> {
m.add_function(wrap_pyfunction!(layout_from_edge_list, m)?)?;
2022-11-20 13:49:43 +00:00
Ok(())
2022-11-20 16:09:39 +00:00
}