rete-graph 0.3.3__tar.gz → 0.3.4__tar.gz

{rete_graph-0.3.3 → rete_graph-0.3.4}/Cargo.toml

@@ -18,7 +18,7 @@ members = [
 exclude = ["fuzz", "clients/python", "clients/r/src/rust", "clients/java/ffi", "clients/tauri/src-tauri"]
 
 [workspace.package]
-version = "0.3.3"
+version = "0.3.4"
 edition = "2021"
 license = "Apache-2.0"
 repository = "https://github.com/caviri/rete"

{rete_graph-0.3.3 → rete_graph-0.3.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: rete-graph
-Version: 0.3.3
+Version: 0.3.4
 Classifier: Development Status :: 4 - Beta
 Classifier: Intended Audience :: Developers
 Classifier: Intended Audience :: Science/Research

{rete_graph-0.3.3 → rete_graph-0.3.4}/clients/python/Cargo.lock

@@ -627,7 +627,7 @@ checksum = "cab834c73d247e67f4fae452806d17d3c7501756d98c8808d7c9c7aa7d18f973"
 
 [[package]]
 name = "rete-core"
-version = "0.3.3"
+version = "0.3.4"
 dependencies = [
  "blake3",
  "getrandom 0.2.17",
@@ -651,7 +651,7 @@ dependencies = [
 
 [[package]]
 name = "rete-python"
-version = "0.3.3"
+version = "0.3.4"
 dependencies = [
  "pyo3",
  "rete-core",

{rete_graph-0.3.3 → rete_graph-0.3.4}/clients/python/Cargo.toml

@@ -6,7 +6,7 @@ name = "rete-python"
 # Kept in lockstep with pyproject.toml's [project] version, and with the engine's
 # major.minor, by scripts/sync_versions.py (--check runs in CI). __version__ comes
 # from here (CARGO_PKG_VERSION), the wheel metadata from pyproject.
-version = "0.3.3"
+version = "0.3.4"
 edition = "2021"
 license = "Apache-2.0"
 repository = "https://github.com/caviri/rete"

{rete_graph-0.3.3 → rete_graph-0.3.4}/crates/rete-core/src/lib.rs

@@ -227,7 +227,8 @@ pub use meta::{
 };
 #[doc(hidden)]
 pub use pyramid::{
-    build_dendrogram, louvain_one_level, project_graph, Dendrogram, Graph, Partition, PyramidAlgo,
+    build_dendrogram, louvain_one_level, louvain_one_level_stats, project_graph, Dendrogram, Graph,
+    LevelStats, Partition, PyramidAlgo, MAX_LOUVAIN_PASSES,
 };
 #[doc(hidden)]
 pub use reach::{batch_reach_serial, build_adjacency, reach_one};

{rete_graph-0.3.3 → rete_graph-0.3.4}/crates/rete-core/src/pyramid.rs

@@ -154,20 +154,127 @@ impl PyramidAlgo {
     }
 }
 
+/// Most local-moving passes one Louvain level may make before it stops and
+/// returns the partition it has.
+///
+/// A **backstop**, not the termination argument. With the exact move test of
+/// [`louvain_one_level`] every move raises the modularity strictly, so the
+/// passes end on their own. Measured: at most 24 passes on any level of 500
+/// million random graphs, and at most 186 on 21 real datasets of up to 11.7
+/// million triples (proteinbase's base level; the next highest was 77). The
+/// cap is about ten times that worst case (`docs/SPEC.md` §7.1). It exists so
+/// that no future numeric defect, or a caller of the public
+/// [`Graph::from_edges`] with weights the exact path does not cover, can turn
+/// a build into an infinite loop again, as rete 0.3.3 and earlier could (see
+/// [`louvain_one_level`]). Reaching it is not an error: the level ends with
+/// the partition it has, which is valid, merely one a further pass might
+/// still have improved.
+pub const MAX_LOUVAIN_PASSES: usize = 2000;
+
+/// What one Louvain level did (for tests and the termination harness).
+#[derive(Debug, Clone, Copy, PartialEq, Eq, Default)]
+pub struct LevelStats {
+    /// Local-moving passes made (each a sweep over every node).
+    pub passes: usize,
+    /// True if the level stopped at [`MAX_LOUVAIN_PASSES`] with nodes still
+    /// moving, rather than converging.
+    pub capped: bool,
+}
+
+/// How a level compares two candidate communities' gains.
+#[derive(Debug, Clone, Copy, PartialEq, Eq)]
+enum GainTest {
+    /// Integer weights and `(2m)² ≤ 2^53`: the cross-multiplied gains are
+    /// integers an `f64` holds exactly.
+    ExactF64,
+    /// Integer weights, larger graph: the same integers in `i128`.
+    ExactI128,
+    /// Non-integer weights (reachable only through the public
+    /// [`Graph::from_edges`]; nothing in rete builds such a graph): the
+    /// floating-point gain, where a move counts only when it wins by more than
+    /// a bound on its rounding error.
+    Tolerant,
+}
+
+/// `2^53`: every integer up to it is exactly representable in an `f64`.
+const F64_EXACT_INT: f64 = 9_007_199_254_740_992.0;
+
+impl Graph {
+    fn gain_test(&self) -> GainTest {
+        let two_m = 2.0 * self.m;
+        let integral = |x: f64| x.is_finite() && x.fract() == 0.0;
+        // Every edge weight integral, and every sum the level forms (degrees,
+        // community totals, k_{i,c}, all ≤ 2m) exactly representable.
+        let exact_sums = integral(self.m)
+            && two_m <= F64_EXACT_INT
+            && self
+                .adj
+                .iter()
+                .all(|nbrs| nbrs.iter().all(|&(_, w)| integral(w)));
+        if !exact_sums {
+            GainTest::Tolerant
+        } else if two_m * two_m <= F64_EXACT_INT {
+            GainTest::ExactF64
+        } else {
+            GainTest::ExactI128
+        }
+    }
+}
+
 /// One level of Louvain local-moving modularity optimization.
 ///
 /// Nodes start in their own community; each is greedily moved to the neighboring
 /// community giving the best modularity gain until no move improves. IDs in the
 /// result are renumbered densely.
+///
+/// # The move test is exact
+///
+/// Moving node `i` (degree `k_i`, with `k_{i,c}` of its edge weight going into
+/// community `c`, whose other members' degrees total `Σ_c`) into `c` gains
+/// `k_{i,c} − Σ_c·k_i / 2m`, up to a positive factor common to every `c`.
+/// Through 0.3.3 that was computed in floating point, and the division by `2m`
+/// is inexact whenever `2m` is not a power of two. Two candidates with *equal*
+/// gains could then round one ulp apart, the strict `>` moved a node on a gain
+/// of zero, a second node did the same the other way, and the passes, which
+/// had no limit, swapped the pair forever. A graph of 15 triples is enough
+/// (`tests/louvain_termination.rs`).
+///
+/// The test is now made on `k_{i,c}·2m − Σ_c·k_i`, the gain times `2m`, with no
+/// division. Every weight rete builds is an integer count (one per triple,
+/// summed by [`Graph::quotient`]), so these are integers. They are exact in
+/// `f64` while `(2m)² ≤ 2^53`, because every product is at most `(2m)²`
+/// (`k_{i,c} ≤ k_i ≤ 2m` and `Σ_c ≤ 2m`): up to 47,453,132 projected edges.
+/// Beyond that they are computed in `i128`, exact while `2m ≤ 2^53`, the point
+/// where the `f64` sums themselves would stop being exact. So a node moves only
+/// on a strictly positive true gain, each move raises the modularity, and the
+/// passes must end. For non-integer weights (only via the public
+/// [`Graph::from_edges`]) a move must win by more than a bound on the rounding
+/// error, which keeps every accepted move a true improvement as well.
+/// [`MAX_LOUVAIN_PASSES`] backs all of this up.
+///
+/// Ties keep the old rule: candidates are scanned in sorted order and the
+/// first best one wins (the node's own community, then the smallest id). The
+/// partition is therefore reproducible across runs and platforms; native and
+/// wasm compute the same integers.
 pub fn louvain_one_level(g: &Graph) -> Partition {
+    louvain_one_level_stats(g).0
+}
+
+/// [`louvain_one_level`], also returning how many passes it made and whether
+/// it stopped at [`MAX_LOUVAIN_PASSES`].
+pub fn louvain_one_level_stats(g: &Graph) -> (Partition, LevelStats) {
     let n = g.n;
     if g.m == 0.0 {
-        return Partition {
-            comm: (0..n).collect(),
-            count: n,
-        };
+        return (
+            Partition {
+                comm: (0..n).collect(),
+                count: n,
+            },
+            LevelStats::default(),
+        );
     }
     let two_m = 2.0 * g.m;
+    let test = g.gain_test();
     let mut comm: Vec<usize> = (0..n).collect();
     let mut sigma_tot: Vec<f64> = g.degree.clone(); // each node alone
 
@@ -176,13 +283,19 @@ pub fn louvain_one_level(g: &Graph) -> Partition {
     // recorded in `touched`. A dense array + touched-list replaces the per-node
     // `HashMap` the textbook formulation allocates — same accumulation order (the
     // adjacency is index-sorted, so the float sums are bit-identical) and the same
-    // sorted candidate scan, so the partition is byte-for-byte unchanged. Edge
-    // weights are strictly positive, so `k_to[c] == 0.0` reliably means "untouched".
+    // sorted candidate scan. Edge weights are strictly positive, so
+    // `k_to[c] == 0.0` reliably means "untouched".
     let mut k_to = vec![0.0f64; n];
     let mut touched: Vec<usize> = Vec::new();
 
+    let mut stats = LevelStats::default();
     let mut improved = true;
     while improved {
+        if stats.passes == MAX_LOUVAIN_PASSES {
+            stats.capped = true;
+            break;
+        }
+        stats.passes += 1;
         improved = false;
         for (i, neighbors) in g.adj.iter().enumerate() {
             let ci = comm[i];
@@ -203,20 +316,56 @@ pub fn louvain_one_level(g: &Graph) -> Partition {
                 }
             }
 
-            // Gain of placing i into community c: k_{i,c} - sigma_tot[c]*ki/2m.
-            let gain = |c: usize| -> f64 { k_to[c] - sigma_tot[c] * ki / two_m };
             // Scan candidate communities in a deterministic (sorted) order so an
             // equal-gain tie always resolves to the same community across runs —
             // the second half of making the pyramid reproducible. Strict `>`
-            // keeps the first (smallest-id) community on ties.
-            let mut best_c = ci;
-            let mut best_gain = gain(ci);
+            // keeps the first candidate (i's own community, then the smallest
+            // id) on ties. The gains compared are exact; see the doc comment.
             touched.sort_unstable();
-            for &c in &touched {
-                let gc = gain(c);
-                if gc > best_gain {
-                    best_gain = gc;
-                    best_c = c;
+            let mut best_c = ci;
+            match test {
+                GainTest::ExactF64 => {
+                    // Integers ≤ (2m)² ≤ 2^53: exact, and so is their difference.
+                    let gain = |c: usize| k_to[c] * two_m - sigma_tot[c] * ki;
+                    let mut best = gain(ci);
+                    for &c in &touched {
+                        let gc = gain(c);
+                        if gc > best {
+                            best = gc;
+                            best_c = c;
+                        }
+                    }
+                }
+                GainTest::ExactI128 => {
+                    // Integers ≤ 2^53, so `as` is exact; products < 2^106.
+                    let (tm, k) = (two_m as i128, ki as i128);
+                    let gain = |c: usize| (k_to[c] as i128) * tm - (sigma_tot[c] as i128) * k;
+                    let mut best = gain(ci);
+                    for &c in &touched {
+                        let gc = gain(c);
+                        if gc > best {
+                            best = gc;
+                            best_c = c;
+                        }
+                    }
+                }
+                GainTest::Tolerant => {
+                    // Both terms of a gain are at most `ki` in magnitude
+                    // (k_{i,c} ≤ k_i, Σ_c ≤ 2m) and come from at most deg+3
+                    // rounded operations, so each gain is off by less than
+                    // (deg+4)·ε·k_i, and a difference of two by twice that. A
+                    // move must win by more than this margin, so every move
+                    // accepted is a true gain.
+                    let tol = 2.0 * (neighbors.len() as f64 + 4.0) * f64::EPSILON * ki;
+                    let gain = |c: usize| k_to[c] - sigma_tot[c] * ki / two_m;
+                    let mut best = gain(ci);
+                    for &c in &touched {
+                        let gc = gain(c);
+                        if gc > best + tol {
+                            best = gc;
+                            best_c = c;
+                        }
+                    }
                 }
             }
 
@@ -240,10 +389,13 @@ pub fn louvain_one_level(g: &Graph) -> Partition {
         let next = remap.len();
         *c = *remap.entry(*c).or_insert(next);
     }
-    Partition {
-        count: remap.len(),
-        comm,
-    }
+    (
+        Partition {
+            count: remap.len(),
+            comm,
+        },
+        stats,
+    )
 }
 
 /// Project RDF integer triples onto the undirected node graph the pyramid
@@ -407,6 +559,73 @@ mod tests {
         assert_ne!(c0, c3);
     }
 
+    /// The base graph of `tests/fixtures/louvain-hangs/min-15-level0.nt`, on
+    /// which rete 0.3.3 looped forever, as (n, edges).
+    fn min_15_edges() -> (usize, Vec<(usize, usize, f64)>) {
+        let text = include_str!("../tests/fixtures/louvain-hangs/min-15-level0.nt");
+        let quads = crate::ingest::parse_statements(text, "nt").unwrap();
+        let mut db = DictionaryBuilder::new();
+        for (s, p, o, _) in &quads {
+            db.observe(s, p, o);
+        }
+        let dict = db.build();
+        let edges = quads
+            .iter()
+            .map(|(s, p, o, _)| {
+                let (s, _, o) = dict.encode(s, p, o).unwrap();
+                (
+                    dict.subject_node(s) as usize,
+                    dict.object_node(o) as usize,
+                    1.0,
+                )
+            })
+            .collect();
+        (dict.node_count() as usize, edges)
+    }
+
+    #[test]
+    fn the_gain_test_follows_the_weights() {
+        let (n, edges) = min_15_edges();
+        assert_eq!(Graph::from_edges(n, &edges).gain_test(), GainTest::ExactF64);
+        // (2m)² > 2^53: integers too big to cross-multiply in f64.
+        let big: Vec<_> = edges.iter().map(|&(u, v, _)| (u, v, 1e7)).collect();
+        assert_eq!(Graph::from_edges(n, &big).gain_test(), GainTest::ExactI128);
+        let half: Vec<_> = edges.iter().map(|&(u, v, _)| (u, v, 0.5)).collect();
+        assert_eq!(Graph::from_edges(n, &half).gain_test(), GainTest::Tolerant);
+    }
+
+    /// Modularity is invariant under scaling every weight, so all three paths
+    /// must find the same partition of the graph that used to hang, and none
+    /// may need the pass cap.
+    #[test]
+    fn every_gain_test_converges_on_the_old_hang_to_one_partition() {
+        let (n, edges) = min_15_edges();
+        let base = louvain_one_level_stats(&Graph::from_edges(n, &edges));
+        assert!(!base.1.capped);
+        for (scale, path) in [
+            (1e7, GainTest::ExactI128),
+            (0.5, GainTest::Tolerant),
+            (0.1, GainTest::Tolerant),
+        ] {
+            let scaled: Vec<_> = edges.iter().map(|&(u, v, w)| (u, v, w * scale)).collect();
+            let g = Graph::from_edges(n, &scaled);
+            assert_eq!(g.gain_test(), path);
+            let (p, st) = louvain_one_level_stats(&g);
+            assert!(!st.capped, "scale {scale}: capped");
+            assert_eq!(p, base.0, "scale {scale}: a different partition");
+        }
+    }
+
+    #[test]
+    fn levels_report_their_passes() {
+        let (p, st) = louvain_one_level_stats(&barbell());
+        assert_eq!(p.count, 2);
+        assert!(st.passes >= 2 && st.passes < MAX_LOUVAIN_PASSES, "{st:?}");
+        assert!(!st.capped);
+        let (_, st) = louvain_one_level_stats(&Graph::from_edges(3, &[]));
+        assert_eq!(st, LevelStats::default());
+    }
+
     /// Two fully-connected triples-clusters joined by one bridge edge, expressed
     /// as RDF `knows` triples, then projected and clustered.
     #[test]

rete_graph-0.3.4/crates/rete-core/tests/fixtures/louvain-hangs/jev-commander-145.nt

@@ -0,0 +1,149 @@
+# Louvain non-termination regression, reported by the Jev Games consumer
+# (rete-graph 0.3.2 never returned from build; their fixture
+# test/fixtures/rete-louvain-hangs.json, jev-games commit 8666728, "commander").
+# 145 distinct triples, verbatim.
+<urn:jev-games:cmdr:g> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Game> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#status> "playing" .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#phase> "main1" .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#turn> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#active> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#toMove> <urn:jev-games:cmdr:g/side/p1> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#seatCount> "3"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#firstTurn> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#stackCount> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#queueCount> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#commanderMoveCount> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g> <https://jev-games.dev/ns/mtg-commander#startingLife> "40"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/stack/0> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#StackObject> .
+<urn:jev-games:cmdr:g/stack/0> <https://jev-games.dev/ns/mtg-commander#stackIndex> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/stack/0> <https://jev-games.dev/ns/mtg-commander#controller> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g/stack/0> <https://jev-games.dev/ns/mtg-commander#stackKind> "spell" .
+<urn:jev-games:cmdr:g/stack/0> <https://jev-games.dev/ns/mtg-commander#source> <urn:jev-games:cmdr:g/card/sol-ring~p2-38> .
+<urn:jev-games:cmdr:g/stack/0> <https://jev-games.dev/ns/mtg-commander#isTop> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/stack/0> <https://jev-games.dev/ns/mtg-commander#sourceName> "Sol Ring" .
+<urn:jev-games:cmdr:g/side/p1> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Player> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#key> "p1" .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#seat> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#life> "40"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#out> "false"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#drewFromEmpty> "false"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#handCount> "7"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#libraryCount> "92"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#landsPlayed> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#extraLandDrops> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#identity> "G" .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#identity> "U" .
+<urn:jev-games:cmdr:g/side/p1> <https://jev-games.dev/ns/mtg-commander#identity> "W" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Card> .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#cid> "tidus-yuna-s-guardian~p1-99" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#name> "Tidus, Yuna's Guardian" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#owner> <urn:jev-games:cmdr:g/side/p1> .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#zone> "command" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#zoneOf> <urn:jev-games:cmdr:g/side/p1> .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#isCommander> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#commanderCasts> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#type> "Creature" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#supertype> "Legendary" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Human" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Warrior" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#colour> "G" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#colour> "U" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#colour> "W" .
+<urn:jev-games:cmdr:g/card/tidus-yuna-s-guardian~p1-99> <https://jev-games.dev/ns/mtg-commander#manaValue> "3"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Player> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#key> "p2" .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#seat> "2"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#life> "40"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#out> "false"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#drewFromEmpty> "false"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#handCount> "6"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#libraryCount> "91"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#landsPlayed> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#extraLandDrops> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#identity> "B" .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#identity> "U" .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#identity> "W" .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#turnCount> <urn:jev-games:cmdr:g/side/p2/turn/lands> .
+<urn:jev-games:cmdr:g/side/p2/turn/lands> <https://jev-games.dev/ns/mtg-commander#turnKey> "lands" .
+<urn:jev-games:cmdr:g/side/p2/turn/lands> <https://jev-games.dev/ns/mtg-commander#count> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#turnCount> <urn:jev-games:cmdr:g/side/p2/turn/entered> .
+<urn:jev-games:cmdr:g/side/p2/turn/entered> <https://jev-games.dev/ns/mtg-commander#turnKey> "entered" .
+<urn:jev-games:cmdr:g/side/p2/turn/entered> <https://jev-games.dev/ns/mtg-commander#count> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#turnCount> <urn:jev-games:cmdr:g/side/p2/turn/spent> .
+<urn:jev-games:cmdr:g/side/p2/turn/spent> <https://jev-games.dev/ns/mtg-commander#turnKey> "spent" .
+<urn:jev-games:cmdr:g/side/p2/turn/spent> <https://jev-games.dev/ns/mtg-commander#count> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#turnCount> <urn:jev-games:cmdr:g/side/p2/turn/spells> .
+<urn:jev-games:cmdr:g/side/p2/turn/spells> <https://jev-games.dev/ns/mtg-commander#turnKey> "spells" .
+<urn:jev-games:cmdr:g/side/p2/turn/spells> <https://jev-games.dev/ns/mtg-commander#count> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#turnCount> <urn:jev-games:cmdr:g/side/p2/turn/castIds> .
+<urn:jev-games:cmdr:g/side/p2/turn/castIds> <https://jev-games.dev/ns/mtg-commander#turnKey> "castIds" .
+<urn:jev-games:cmdr:g/side/p2/turn/castIds> <https://jev-games.dev/ns/mtg-commander#count> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p2> <https://jev-games.dev/ns/mtg-commander#turnCount> <urn:jev-games:cmdr:g/side/p2/turn/noncreature> .
+<urn:jev-games:cmdr:g/side/p2/turn/noncreature> <https://jev-games.dev/ns/mtg-commander#turnKey> "noncreature" .
+<urn:jev-games:cmdr:g/side/p2/turn/noncreature> <https://jev-games.dev/ns/mtg-commander#count> "1"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Card> .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#cid> "y-shtola-night-s-blessed~p2-99" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#name> "Y'shtola, Night's Blessed" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#owner> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#zone> "command" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#zoneOf> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#isCommander> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#commanderCasts> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#type> "Creature" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#supertype> "Legendary" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Cat" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Warlock" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#colour> "B" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#colour> "U" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#colour> "W" .
+<urn:jev-games:cmdr:g/card/y-shtola-night-s-blessed~p2-99> <https://jev-games.dev/ns/mtg-commander#manaValue> "4"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Player> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#key> "p3" .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#seat> "3"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#life> "40"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#out> "false"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#drewFromEmpty> "false"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#handCount> "6"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#libraryCount> "93"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#landsPlayed> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#extraLandDrops> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#identity> "B" .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#identity> "R" .
+<urn:jev-games:cmdr:g/side/p3> <https://jev-games.dev/ns/mtg-commander#identity> "W" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Card> .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#cid> "terra-herald-of-hope~p3-99" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#name> "Terra, Herald of Hope" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#owner> <urn:jev-games:cmdr:g/side/p3> .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#zone> "command" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#zoneOf> <urn:jev-games:cmdr:g/side/p3> .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#isCommander> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#commanderCasts> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#type> "Creature" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#supertype> "Legendary" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Human" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Wizard" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#subtype> "Warrior" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#colour> "B" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#colour> "R" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#colour> "W" .
+<urn:jev-games:cmdr:g/card/terra-herald-of-hope~p3-99> <https://jev-games.dev/ns/mtg-commander#manaValue> "3"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#Card> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#cid> "sunken-ruins~p2-29" .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#name> "Sunken Ruins" .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#owner> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#zone> "battlefield" .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#zoneOf> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#type> "Land" .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#manaValue> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#controller> <urn:jev-games:cmdr:g/side/p2> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#battlefieldOrder> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#boardOrder> "2000"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#tapped> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#sick> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#damage> "0"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/card/sunken-ruins~p2-29> <https://jev-games.dev/ns/mtg-commander#enteredThisTurn> "true"^^<http://www.w3.org/2001/XMLSchema#boolean> .
+<https://jev-games.dev/ns/mtg-commander#CommanderRules> <https://jev-games.dev/ns/mtg-commander#commanderDamageToLose> "21"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<https://jev-games.dev/ns/mtg-commander#CommanderRules> <https://jev-games.dev/ns/mtg-commander#handSize> "7"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<https://jev-games.dev/ns/mtg-commander#CommanderRules> <https://jev-games.dev/ns/mtg-commander#taxPerCast> "2"^^<http://www.w3.org/2001/XMLSchema#integer> .
+<urn:jev-games:cmdr:g/step/9> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <https://jev-games.dev/ns/mtg-commander#CommanderStep> .
+<urn:jev-games:cmdr:g/step/9> <https://jev-games.dev/ns#actor> <urn:jev-games:cmdr:g/side/p1> .

rete_graph-0.3.4/crates/rete-core/tests/fixtures/louvain-hangs/jev-random30-30.nt

@@ -0,0 +1,34 @@
+# Louvain non-termination regression, reported by the Jev Games consumer
+# (rete-graph 0.3.2 never returned from build; their fixture
+# test/fixtures/rete-louvain-hangs.json, jev-games commit 8666728, "random"[0]).
+# 30 distinct triples, verbatim.
+<urn:n14> <urn:p0> "1" .
+<urn:n4> <urn:p1> <urn:n10> .
+<urn:n13> <urn:p0> <urn:n3> .
+<urn:n13> <urn:p2> "4" .
+<urn:n18> <urn:p2> "3" .
+<urn:n17> <urn:p2> "0" .
+<urn:n18> <urn:p1> "3" .
+<urn:n13> <urn:p2> <urn:n11> .
+<urn:n18> <urn:p1> <urn:n21> .
+<urn:n8> <urn:p1> <urn:n22> .
+<urn:n13> <urn:p2> "2" .
+<urn:n14> <urn:p2> "2" .
+<urn:n9> <urn:p1> <urn:n6> .
+<urn:n2> <urn:p1> <urn:n4> .
+<urn:n15> <urn:p1> <urn:n18> .
+<urn:n12> <urn:p2> <urn:n20> .
+<urn:n5> <urn:p0> "4" .
+<urn:n18> <urn:p1> "0" .
+<urn:n4> <urn:p0> <urn:n18> .
+<urn:n12> <urn:p1> <urn:n17> .
+<urn:n15> <urn:p2> <urn:n10> .
+<urn:n21> <urn:p1> <urn:n1> .
+<urn:n15> <urn:p2> "0" .
+<urn:n3> <urn:p2> "3" .
+<urn:n16> <urn:p0> <urn:n5> .
+<urn:n8> <urn:p0> "0" .
+<urn:n22> <urn:p2> <urn:n13> .
+<urn:n21> <urn:p1> <urn:n15> .
+<urn:n9> <urn:p1> <urn:n7> .
+<urn:n16> <urn:p0> "3" .

rete_graph-0.3.4/crates/rete-core/tests/fixtures/louvain-hangs/jev-random63-63.nt

@@ -0,0 +1,67 @@
+# Louvain non-termination regression, reported by the Jev Games consumer
+# (rete-graph 0.3.2 never returned from build; their fixture
+# test/fixtures/rete-louvain-hangs.json, jev-games commit 8666728, "random"[1]).
+# 63 distinct triples, verbatim.
+<urn:n11> <urn:p2> <urn:n15> .
+<urn:n19> <urn:p1> <urn:n1> .
+<urn:n10> <urn:p0> "3" .
+<urn:n6> <urn:p1> <urn:n4> .
+<urn:n10> <urn:p0> "1" .
+<urn:n4> <urn:p1> "2" .
+<urn:n9> <urn:p1> "3" .
+<urn:n7> <urn:p0> "0" .
+<urn:n18> <urn:p2> <urn:n15> .
+<urn:n12> <urn:p2> "3" .
+<urn:n2> <urn:p0> <urn:n9> .
+<urn:n12> <urn:p1> "2" .
+<urn:n11> <urn:p2> "1" .
+<urn:n5> <urn:p0> <urn:n14> .
+<urn:n13> <urn:p0> <urn:n1> .
+<urn:n15> <urn:p1> <urn:n7> .
+<urn:n6> <urn:p0> <urn:n16> .
+<urn:n2> <urn:p2> "2" .
+<urn:n7> <urn:p1> <urn:n4> .
+<urn:n8> <urn:p0> <urn:n2> .
+<urn:n14> <urn:p0> <urn:n10> .
+<urn:n7> <urn:p1> <urn:n12> .
+<urn:n5> <urn:p0> <urn:n17> .
+<urn:n4> <urn:p0> <urn:n13> .
+<urn:n0> <urn:p1> "3" .
+<urn:n8> <urn:p2> <urn:n7> .
+<urn:n6> <urn:p0> "1" .
+<urn:n15> <urn:p0> "4" .
+<urn:n2> <urn:p1> <urn:n10> .
+<urn:n16> <urn:p1> <urn:n19> .
+<urn:n11> <urn:p0> <urn:n13> .
+<urn:n0> <urn:p2> <urn:n17> .
+<urn:n18> <urn:p2> <urn:n12> .
+<urn:n14> <urn:p0> <urn:n3> .
+<urn:n5> <urn:p0> <urn:n19> .
+<urn:n13> <urn:p2> "0" .
+<urn:n13> <urn:p2> "3" .
+<urn:n13> <urn:p0> "0" .
+<urn:n3> <urn:p2> <urn:n4> .
+<urn:n12> <urn:p0> "3" .
+<urn:n2> <urn:p2> <urn:n0> .
+<urn:n16> <urn:p0> "3" .
+<urn:n12> <urn:p2> <urn:n7> .
+<urn:n4> <urn:p2> <urn:n9> .
+<urn:n0> <urn:p1> <urn:n1> .
+<urn:n9> <urn:p1> <urn:n19> .
+<urn:n19> <urn:p0> <urn:n19> .
+<urn:n14> <urn:p0> <urn:n9> .
+<urn:n18> <urn:p2> "4" .
+<urn:n9> <urn:p0> <urn:n3> .
+<urn:n1> <urn:p2> <urn:n17> .
+<urn:n11> <urn:p1> "3" .
+<urn:n6> <urn:p1> <urn:n14> .
+<urn:g> <urn:g> "0" .
+<urn:g> <urn:g> "1" .
+<urn:g> <urn:g> "2" .
+<urn:g> <urn:g> "3" .
+<urn:g> <urn:g> "4" .
+<urn:g> <urn:g> "5" .
+<urn:g> <urn:g> "6" .
+<urn:g> <urn:g> "7" .
+<urn:g> <urn:g> "8" .
+<urn:g> <urn:g> "9" .

rete_graph-0.3.4/crates/rete-core/tests/fixtures/louvain-hangs/min-15-level0.nt

@@ -0,0 +1,20 @@
+# Louvain non-termination regression (rete 0.3.3 and earlier never return from
+# build on this graph). 15 triples, 7 nodes, so 2m = 30: two nodes swap between
+# two communities whose gains are exactly equal (10/30 and 12/30) but round one
+# ulp apart in floating point. The smallest hang found: none at <= 13 triples in
+# 100M random graphs. Found by dev/louvain-hang (seed 2959679, LH_MAXT=26 LH_MAXN=20).
+<urn:n0> <urn:p1> <urn:n0> .
+<urn:n1> <urn:p1> "1" .
+<urn:n1> <urn:p1> <urn:n0> .
+<urn:n0> <urn:p1> <urn:n1> .
+<urn:n0> <urn:p0> <urn:n1> .
+<urn:n1> <urn:p0> <urn:n1> .
+<urn:n2> <urn:p0> <urn:n0> .
+<urn:n1> <urn:p1> "0" .
+<urn:n0> <urn:p1> "0" .
+<urn:n0> <urn:p0> "1" .
+<urn:n0> <urn:p0> <urn:n0> .
+<urn:n2> <urn:p1> <urn:n1> .
+<urn:n2> <urn:p1> "2" .
+<urn:n2> <urn:p0> "3" .
+<urn:n1> <urn:p1> "3" .

rete_graph-0.3.4/crates/rete-core/tests/fixtures/louvain-hangs/min-18-level1.nt

@@ -0,0 +1,21 @@
+# Louvain non-termination regression: 18 triples, a hang at level 1 (the
+# aggregated graph, whose self-loops and summed weights are still integers).
+# Found by dev/louvain-hang (seed 20519787, LH_MAXT=26 LH_MAXN=20).
+<urn:n1> <urn:p0> <urn:n5> .
+<urn:n7> <urn:p0> "0" .
+<urn:n9> <urn:p0> "0" .
+<urn:n11> <urn:p0> "0" .
+<urn:n4> <urn:p0> "0" .
+<urn:n6> <urn:p0> "0" .
+<urn:n0> <urn:p0> "0" .
+<urn:n0> <urn:p0> <urn:n1> .
+<urn:n9> <urn:p0> <urn:n7> .
+<urn:n8> <urn:p0> "0" .
+<urn:n7> <urn:p0> <urn:n3> .
+<urn:n8> <urn:p0> <urn:n3> .
+<urn:n2> <urn:p0> "0" .
+<urn:n0> <urn:p0> <urn:n10> .
+<urn:n10> <urn:p0> "0" .
+<urn:n6> <urn:p0> <urn:n9> .
+<urn:n3> <urn:p0> "0" .
+<urn:n2> <urn:p0> <urn:n7> .

rete_graph-0.3.4/crates/rete-core/tests/louvain_termination.rs

@@ -0,0 +1,155 @@
+//! Louvain must terminate: graphs on which `build` never returned in rete 0.3.3
+//! and earlier (see `pyramid::louvain_one_level`). Every level of every
+//! fixture must converge on its own, well inside `MAX_LOUVAIN_PASSES`, and
+//! the whole build must return. Each check runs on a worker thread under a
+//! time limit, so a regression fails here instead of hanging the suite.
+//!
+//! Fixtures (`tests/fixtures/louvain-hangs/`):
+//! - `min-15-level0.nt`, `min-18-level1.nt`: the smallest hangs found by the
+//!   random-graph harness, one in the base graph and one in the aggregated
+//!   level above it;
+//! - `jev-*.nt`: reported by the Jev Games consumer (a 145-triple Commander
+//!   position and two random graphs of 30 and 63 triples).
+
+use std::sync::mpsc;
+use std::time::Duration;
+
+use rete_core::ingest::{assemble_dataset, parse_statements};
+use rete_core::{
+    build_dendrogram, louvain_one_level_stats, project_graph, DictionaryBuilder, MAX_LOUVAIN_PASSES,
+};
+
+const FIXTURES: &[(&str, &str)] = &[
+    (
+        "min-15-level0",
+        include_str!("fixtures/louvain-hangs/min-15-level0.nt"),
+    ),
+    (
+        "min-18-level1",
+        include_str!("fixtures/louvain-hangs/min-18-level1.nt"),
+    ),
+    (
+        "jev-commander-145",
+        include_str!("fixtures/louvain-hangs/jev-commander-145.nt"),
+    ),
+    (
+        "jev-random30-30",
+        include_str!("fixtures/louvain-hangs/jev-random30-30.nt"),
+    ),
+    (
+        "jev-random63-63",
+        include_str!("fixtures/louvain-hangs/jev-random63-63.nt"),
+    ),
+];
+
+/// Run `f` on a worker thread; fail if it has not returned within `secs`.
+fn within<T: Send + 'static>(what: &str, secs: u64, f: impl FnOnce() -> T + Send + 'static) -> T {
+    let (tx, rx) = mpsc::channel();
+    std::thread::spawn(move || {
+        tx.send(f()).ok();
+    });
+    rx.recv_timeout(Duration::from_secs(secs))
+        .unwrap_or_else(|_| panic!("{what}: did not return within {secs} s"))
+}
+
+/// Per level: (passes, capped, communities), the base graph first.
+fn levels(text: &str) -> Vec<(usize, bool, usize)> {
+    let quads = parse_statements(text, "nt").expect("fixture parses");
+    let mut db = DictionaryBuilder::new();
+    for (s, p, o, _) in &quads {
+        db.observe(s, p, o);
+    }
+    let dict = db.build();
+    let triples: Vec<_> = quads
+        .iter()
+        .map(|(s, p, o, _)| dict.encode(s, p, o).unwrap())
+        .collect();
+    // The loop of `build_dendrogram`, keeping each level's stats.
+    let mut g = project_graph(&dict, &triples);
+    let mut out = Vec::new();
+    loop {
+        let (p, st) = louvain_one_level_stats(&g);
+        out.push((st.passes, st.capped, p.count));
+        if p.count >= g.node_count() {
+            break;
+        }
+        let next = g.quotient(&p.comm, p.count);
+        if next.node_count() <= 1 {
+            break;
+        }
+        g = next;
+    }
+    out
+}
+
+#[test]
+fn every_level_converges_without_the_cap() {
+    for &(name, text) in FIXTURES {
+        let lv = within(name, 30, move || levels(text));
+        assert!(
+            lv.len() >= 2,
+            "{name}: expected at least two levels, got {lv:?}"
+        );
+        for (i, &(passes, capped, _)) in lv.iter().enumerate() {
+            assert!(!capped, "{name}: level {i} stopped at the pass cap: {lv:?}");
+            // Converged levels need a handful of passes; the cap is a backstop.
+            assert!(
+                passes <= 50,
+                "{name}: level {i} took {passes} passes: {lv:?}"
+            );
+            assert!(passes < MAX_LOUVAIN_PASSES);
+        }
+    }
+}
+
+#[test]
+fn the_whole_build_returns() {
+    for &(name, text) in FIXTURES {
+        let n = within(name, 60, move || {
+            let quads = parse_statements(text, "nt").unwrap();
+            let n = quads.len();
+            let (bytes, stats) = assemble_dataset(quads, &[]);
+            assert!(stats.pyramid_levels > 0, "a pyramid was built");
+            assert!(!bytes.is_empty());
+            n
+        });
+        assert!(n >= 15, "{name}: {n} statements");
+    }
+}
+
+/// The partition is a pure function of the input: two builds of the same text
+/// are byte-identical (the pyramid included), and the smallest fixture's
+/// levels are pinned, so a change in a tie decision shows up here. The wasm
+/// test (`crates/rete-wasm/tests/louvain_termination.rs`) pins the same file.
+#[test]
+fn the_fixtures_build_reproducibly() {
+    for &(name, text) in FIXTURES {
+        let build = move || assemble_dataset(parse_statements(text, "nt").unwrap(), &[]).0;
+        let a = within(name, 60, build);
+        let b = within(name, 60, build);
+        assert_eq!(a, b, "{name}: two builds differ");
+    }
+    assert_eq!(
+        dendrogram(FIXTURES[0].1),
+        PINNED_MIN_15,
+        "min-15-level0: the dendrogram (community per node, per level)"
+    );
+}
+
+fn dendrogram(text: &str) -> Vec<Vec<usize>> {
+    let quads = parse_statements(text, "nt").unwrap();
+    let mut db = DictionaryBuilder::new();
+    for (s, p, o, _) in &quads {
+        db.observe(s, p, o);
+    }
+    let dict = db.build();
+    let triples: Vec<_> = quads
+        .iter()
+        .map(|(s, p, o, _)| dict.encode(s, p, o).unwrap())
+        .collect();
+    let d = build_dendrogram(&project_graph(&dict, &triples));
+    d.levels.into_iter().map(|p| p.comm).collect()
+}
+
+/// `dendrogram(min-15-level0.nt)` with the exact move test.
+const PINNED_MIN_15: &[&[usize]] = &[&[0, 0, 1, 0, 0, 1, 1]];

{rete_graph-0.3.3 → rete_graph-0.3.4}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "maturin"
 
 [project]
 name = "rete-graph"
-version = "0.3.3"
+version = "0.3.4"
 description = "Query local and remote .rete graph files with SPARQL — Python bindings for the rete engine."
 readme = "README.md"
 requires-python = ">=3.9"