Function snap_graph

generative/snap.rs:197–226

(graph: GeometryGraph<D>, strategy: SnappingStrategy)

}

pub fn snap_graph<D>(graph: GeometryGraph<D>, strategy: SnappingStrategy) -> GeometryGraph<D>
where
    D: EdgeType,
{
    // You can't look up a node in a graph by its weight (the coordinate)
    // So we need an auxiliary GraphKdTree index for us to look up NodeIndices from their
    // coordinates.
    let mut index = GraphKdTree::new(2);
    for node_idx in graph.node_indices() {
        let node = graph[node_idx];
        let coords = [node.0.x, node.0.y];

        // Don't add duplicate vertices to the index
        let closest = index.nearest(&coords, 1, &squared_euclidean).unwrap();
        if let Some(closest) = closest.first() {
            let (distance, _) = closest;
            if *distance == 0.0 {
                continue;
            }
        }
        index.add(coords, node_idx).unwrap();
    }

    match strategy {
        SnappingStrategy::ClosestPoint(tolerance) => {
            snap_graph_closest_point(graph, &mut index, tolerance)
        }
        SnappingStrategy::RegularGrid(tolerance) => snap_graph_grid(graph, tolerance),
    }
}

fn snap_graph_closest_point<D>(
    mut graph: GeometryGraph<D>,