@@ -1814,12 +1814,12 @@ function(D, maxLength)
18141814 # Extends a given chordless path if possible
18151815 CCExtension := function (digraph, path, C, key, blocked )
18161816 local v, extendedPath, data;
1817- blocked := BlockNeighbours(digraph, Last (path), blocked);
1818- for v in OutNeighboursOfVertex(digraph, Last (path)) do
1817+ blocked := BlockNeighbours(digraph, path [ Length (path)] , blocked);
1818+ for v in OutNeighboursOfVertex(digraph, path [ Length (path)] ) do
18191819 if DigraphVertexLabel(digraph, v) > key and blocked[ v] = 1
18201820 and Length(path) < maxLength then
18211821 extendedPath := Concatenation(path, [ v] );
1822- if IsDigraphEdge(digraph, v, First( path) ) then
1822+ if IsDigraphEdge(digraph, v, path[ 1 ] ) then
18231823 Add(C, extendedPath);
18241824 else
18251825 data := CCExtension(digraph, extendedPath, C, key, blocked);
@@ -1828,7 +1828,7 @@ function(D, maxLength)
18281828 fi ;
18291829 fi ;
18301830 od ;
1831- blocked := UnblockNeighbours(digraph, Last (path), blocked);
1831+ blocked := UnblockNeighbours(digraph, path [ Length (path)] , blocked);
18321832 return [ C, blocked] ;
18331833 end ;
18341834
0 commit comments