Function graph_split_minimizes_cross_edges

nodedb-cluster/src/shard_split.rs:266–283

()

    #[test]
    fn graph_split_minimizes_cross_edges() {
        // Chain: a→b→c→d→e. Splitting at midpoint should produce
        // fewer cross-edges than random split.
        let nodes: Vec<String> = vec!["a", "b", "c", "d", "e"]
            .into_iter()
            .map(|s| s.to_string())
            .collect();
        let edges: Vec<(String, String)> = vec![
            ("a".into(), "b".into()),
            ("b".into(), "c".into()),
            ("c".into(), "d".into()),
            ("d".into(), "e".into()),
        ];
        let plan = plan_graph_split(10, 20, 3, &nodes, &edges);
        // 5 nodes split: mid = 5/2 = 2, so 3 docs move (5 - 2).
        assert_eq!(plan.documents_to_move.len(), 3);
        assert_eq!(plan.strategy, SplitStrategy::GraphCommunity);
    }

    #[test]
    fn graph_split_empty() {