replacing custom algorithm with Digraph library call

lib/linearnotation.gi

@@ -15,27 +15,9 @@
 # of its functional digraph.
 # A component is a list of points, and the components are returned in a list.
 TransformationComponents := function(t)
-local visited,comps, i,actualcomp;
-  comps := [];           #components will be represented as list of points
-  visited := [];         #we keep track of the points we visited already
-  #seemingly going through all points...
-  for i in [1..DegreeOfTransformation(t)] do
-    #...but skipping those that are already in some component
-    if not (i in visited) then
-      Add(comps,[]); #let's start with a fresh new component
-      actualcomp := comps[Length(comps)]; #make the last to the actual one
-      repeat
-        AddSet(actualcomp,i);
-        AddSet(visited,i);
-        i := i ^ t;
-      until i in visited; #keep adding until we bump into something known
-      if not (i in actualcomp) then #known but not in actual component -> merge
-        Append(First(comps, c -> i in c), actualcomp);
-        Remove(comps); # & remove the last component
-      fi;
-    fi;
-  od;
-  return comps;
+  return DigraphConnectedComponents(
+            DigraphByEdges(List([1..DegreeOfTransformation(t)],
+            i->[i,OnPoints(i,t)]))).comps;
 end;
 MakeReadOnlyGlobal("TransformationComponents");
 

lib/skeleton.gi

@@ -99,8 +99,6 @@ end);
 ################################################################################
 
 #the subduction Hasse diagram of representatives
-
-
 InstallMethod(SubductionEquivClassRelation,
         "for a skeleton (SgpDec)", [IsSkeleton],
 function(sk)
@@ -279,7 +277,6 @@ function(sk)
   fi;
 end);
 
-
 #returns the representative element of the scc of a finiteset
 InstallGlobalFunction(RepresentativeSet,
 function(sk, finiteset)