Function snap_graph_nodes

generative/snap.rs:303–328

Snap `snap_from` to `snap_to`, and update all of `snap_from`s adjacencies

(
    graph: &mut GeometryGraph<D>,
    snap_from: NodeIndex<usize>,
    snap_to: NodeIndex<usize>,
)

/// Snap `snap_from` to `snap_to`, and update all of `snap_from`s adjacencies
fn snap_graph_nodes<D>(
    graph: &mut GeometryGraph<D>,
    snap_from: NodeIndex<usize>,
    snap_to: NodeIndex<usize>,
) where
    D: EdgeType,
{
    debug_assert_ne!(snap_from, snap_to);

    let neighbors: Vec<_> = graph.neighbors(snap_from).collect();
    let mut neighbors_to_snap = Vec::new();
    for neighbor in neighbors {
        // don't add a self-edge
        if neighbor != snap_to {
            graph.update_edge(snap_to, neighbor, ());
            if graph[neighbor].0 == graph[snap_from].0 {
                neighbors_to_snap.push(neighbor);
            }
        }
    }
    graph[snap_from] = graph[snap_to];

    for neighbor in neighbors_to_snap {
        snap_graph_nodes(graph, neighbor, snap_to);
    }
}

fn snap_graph_grid<D>(mut graph: GeometryGraph<D>, tolerance: f64) -> GeometryGraph<D>
where