Add IsOrderIdeal test

digraphs · Jan 31, 2024 · 7f0bb1f · 7f0bb1f
1 parent c9b35d4
commit 7f0bb1f
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 1 deletion.
diff --git a/gap/oper.gi b/gap/oper.gi
@@ -2083,7 +2083,6 @@ function(D, roots)
   N := Length(roots);
   vertex_in_subset := BlistList([1 .. N], []);
   reachable_vertices := VerticesReachableFrom(D, roots);
-
   for i in roots do
     vertex_in_subset[i] := true;
   od;

diff --git a/tst/standard/oper.tst b/tst/standard/oper.tst
@@ -2816,6 +2816,10 @@ gap> for i in D3_edges do
 >    od;
 gap> VerticesReachableFrom(D3, [1]);
 [  ]
+gap> TestPartialOrderDigraph := Digraph([[1, 3], [2, 3], [3]]);
+<immutable digraph with 3 vertices, 5 edges>
+gap> IsOrderIdeal(TestPartialOrderDigraph, [ 1,2,3 ]);
+true
 
 #  DIGRAPHS_UnbindVariables
 gap> Unbind(C);
@@ -2876,6 +2880,7 @@ gap> Unbind(tclosure);
 gap> Unbind(u1);
 gap> Unbind(u2);
 gap> Unbind(x);
+gap> Unbind(IsPartialOrderDigraph);
 
 #
 gap> DIGRAPHS_StopTest();