Update test for more robustness

digraphs · Nov 11, 2024 · bf6b020 · bf6b020
1 parent b0fe223
commit bf6b020
Show file tree

Hide file tree

Showing 3 changed files with 9 additions and 10 deletions.
diff --git a/doc/grahom.xml b/doc/grahom.xml
@@ -321,9 +321,9 @@ gap> MonomorphismsDigraphsRepresentatives(gr1, CompleteDigraph(3));
     the vertices and the edges of <A>digraph1</A>, and are therefore possibly
     strictly contained in the induced subdigraph on the same vertex set.
     <Example><![CDATA[
-gap> SubdigraphsMonomorphisms(CompleteBipartiteDigraph(2, 2),
-> CompleteDigraph(4));
-[ Transformation( [ 2, 3, 1 ] ), Transformation( [ 1, 3, 2 ] ),
+gap> Set(SubdigraphsMonomorphisms(CompleteBipartiteDigraph(2, 2),
+> CompleteDigraph(4)));
+[ Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 3, 1 ] ),
   Transformation( [ 3, 4, 2, 1 ] ) ]
 gap> SubdigraphsMonomorphismsRepresentatives(
 > CompleteBipartiteDigraph(2, 2), CompleteDigraph(4));

diff --git a/tst/standard/grahom.tst b/tst/standard/grahom.tst
@@ -2762,13 +2762,13 @@ gap> IsLatticeEpimorphism(D, D, (2, 3));
 true
 
 # SubdigraphsMonomorphisms
-gap> SubdigraphsMonomorphisms(CompleteBipartiteDigraph(2, 2),
-> CompleteDigraph(4));
-[ Transformation( [ 2, 3, 1 ] ), Transformation( [ 1, 3, 2 ] ), 
+gap> Set(SubdigraphsMonomorphisms(CompleteBipartiteDigraph(2, 2),
+> CompleteDigraph(4)));
+[ Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 3, 1 ] ), 
   Transformation( [ 3, 4, 2, 1 ] ) ]
 gap> D := DigraphFromGraph6String("D^{");
 <immutable symmetric digraph with 5 vertices, 18 edges>
-gap> SubdigraphsMonomorphisms(CompleteDigraph(4), D);
+gap> Set(SubdigraphsMonomorphisms(CompleteDigraph(4), D));
 [ Transformation( [ 1, 3, 4, 5, 5 ] ), Transformation( [ 2, 3, 4, 5, 5 ] ) ]
 gap> Length(SubdigraphsMonomorphisms(CompleteDigraph(4), CompleteDigraph(12)));
 495

diff --git a/tst/testinstall.tst b/tst/testinstall.tst
@@ -455,9 +455,8 @@ gap> DigraphEdges(C);
 # Issue #704 SubdigraphsMonomorphisms bug
 gap> d := Digraph([[2, 3, 4, 5], [1, 3, 4], [1, 2, 4, 5], [1, 2, 3, 5], 
 > [1, 3, 4]]);;
-gap> SubdigraphsMonomorphisms(CompleteMultipartiteDigraph([2, 3]), d);
-[ Transformation( [ 1, 3, 2 ] ), Transformation( [ 2, 5, 1, 3, 4 ] ), 
-  Transformation( [ 1, 4, 2, 3 ] ), Transformation( [ 3, 4, 2, 1 ] ) ]
+gap> Length(SubdigraphsMonomorphisms(CompleteMultipartiteDigraph([2, 3]), d));
+4
 
 #  DIGRAPHS_UnbindVariables
 gap> Unbind(C);