[Refactor] Minimal_dseparator: Multiple start and end nodes (#28)

mdrazak2001 · ankurankan · web-flow · commit 910c9f746417 · 2025-10-20T06:12:42.000+02:00
* * refactor minimal_dseparartor
* start &amp; end nodes accept a list

* add tests

* R bindings refactors

* python bindings refactors

* wasm test refactors

* trying to fix windows build failure

---------

Co-authored-by: Ankur Ankan &lt;ankurankan@gmail.com&gt;
diff --git a/rust_core/tests/test_dag.rs b/rust_core/tests/test_dag.rs
@@ -431,7 +431,7 @@ fn test_fork_convergence_pattern() {
 
     // No separator should exist because B→D and C→D are direct edges
     assert!(result.is_err());
-    assert!(result.unwrap_err().to_string().contains("adjacent"));
+    assert!(result.unwrap_err().contains("No possible separators because B and D are adjacent"));
 }
 
 #[test]

Original file line number	Diff line number	Diff line change
`@@ -431,7 +431,7 @@ fn test_fork_convergence_pattern() {`
`431`	`431`
`432`	`432`	`// No separator should exist because B→D and C→D are direct edges`
`433`	`433`	`assert!(result.is_err());`
`434`		`- assert!(result.unwrap_err().to_string().contains("adjacent"));`
	`434`	`+ assert!(result.unwrap_err().contains("No possible separators because B and D are adjacent"));`
`435`	`435`	`}`
`436`	`436`
`437`	`437`	`#[test]`