graph-force/src/lib.rs

126 lines
3.4 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;
2022-11-22 21:35:51 +00:00
mod networkx_model;
2022-11-23 20:15:03 +00:00
mod reader;
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-25 19:22:17 +00:00
use graph::NodeVector;
use pyo3::exceptions;
use pyo3::{prelude::*, types::PyIterator};
2022-11-20 13:49:43 +00:00
2022-11-23 20:15:03 +00:00
fn pick_model(model: &str) -> Result<Box<dyn model::ForceModel + Send + Sync>, PyErr> {
match model {
"spring_model" => Ok(Box::new(spring_model::SimpleSpringModel::new(1.0))),
"networkx_model" => Ok(Box::new(networkx_model::NetworkXModel::new())),
_ => {
return Err(PyErr::new::<exceptions::PyValueError, _>(
"model must be either 'spring_model' or 'networkx_model'",
))
}
}
}
2022-11-25 19:22:17 +00:00
fn initial_pos_to_node_vector(initial_pos: Option<Vec<(f32, f32)>>) -> Option<NodeVector> {
match initial_pos {
Some(pos) => {
let nodes = graph::new_node_vector(pos.len());
for (i, (x, y)) in pos.iter().enumerate() {
let mut node = nodes[i].write().unwrap();
node.x = *x;
node.y = *y;
}
Some(nodes)
}
None => None,
}
}
#[pyfunction(
file_path,
"*",
iter = 500,
threads = 0,
model = "\"spring_model\"",
initial_pos = "None"
)]
2022-11-23 20:15:03 +00:00
fn layout_from_edge_file(
file_path: &str,
iter: usize,
threads: usize,
model: &str,
2022-11-25 19:22:17 +00:00
initial_pos: Option<Vec<(f32, f32)>>,
2022-11-23 20:15:03 +00:00
) -> PyResult<Vec<(f32, f32)>> {
let (size, matrix) = reader::read_graph(file_path);
let model = pick_model(model)?;
let r = runner::Runner::new(iter, threads);
2022-11-25 19:22:17 +00:00
Ok(r.layout(size, matrix, model, initial_pos_to_node_vector(initial_pos)))
2022-11-23 20:15:03 +00:00
}
2022-11-22 21:35:51 +00:00
#[pyfunction(
number_of_nodes,
edges,
"*",
iter = 500,
threads = 0,
2022-11-25 19:22:17 +00:00
model = "\"spring_model\"",
initial_pos = "None"
2022-11-22 21:35:51 +00:00
)]
2022-11-20 16:09:39 +00:00
fn layout_from_edge_list(
number_of_nodes: usize,
edges: &PyAny,
2022-11-20 16:09:39 +00:00
iter: usize,
threads: usize,
2022-11-22 21:35:51 +00:00
model: &str,
2022-11-25 19:22:17 +00:00
initial_pos: Option<Vec<(f32, f32)>>,
2022-11-20 16:09:39 +00:00
) -> PyResult<Vec<(f32, f32)>> {
2022-11-23 20:15:03 +00:00
let model: Box<dyn model::ForceModel + Send + Sync> = pick_model(model)?;
let mut edge_matrix = graph::new_edge_matrix(number_of_nodes);
match edges.extract::<&PyIterator>() {
Ok(iter) => {
2022-11-23 19:26:57 +00:00
iter.iter()?
.map(|edge| edge.and_then(PyAny::extract::<(usize, usize)>))
.for_each(|edge| {
if let Ok((u, v)) = edge {
graph::add_edge(&mut edge_matrix, u, v);
}
});
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);
2022-11-25 19:22:17 +00:00
Ok(r.layout(
number_of_nodes,
edge_matrix,
model,
initial_pos_to_node_vector(initial_pos),
))
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-23 20:15:03 +00:00
m.add_function(wrap_pyfunction!(layout_from_edge_file, m)?)?;
2022-11-20 13:49:43 +00:00
Ok(())
2022-11-20 16:09:39 +00:00
}