@@ -489,19 +489,19 @@ gap> DigraphShortestDistances(gr);
489489# UnweightedBellmanFord
490490gap> gr := Digraph([[ 1 , 2 ] , [ 3 ] , [ 1 , 2 ] , [ 4 ]] );
491491< immutable digraph with 4 vertices, 6 edges>
492- gap> UnweightedBellmanFord(gr,2 );
492+ gap> UnweightedBellmanFord(gr, 2 );
493493[ [ 2 , 0 , 1 , fail ] , [ 3 , fail , 2 , fail ] ]
494494gap> gr := CycleDigraph(IsMutableDigraph, 3 );
495495< mutable digraph with 3 vertices, 3 edges>
496- gap> UnweightedBellmanFord(gr,3 );
496+ gap> UnweightedBellmanFord(gr, 3 );
497497[ [ 1 , 2 , 0 ] , [ 3 , 1 , fail ] ]
498- gap> gr := Digraph([[] ,[]] );
498+ gap> gr := Digraph([[] , []] );
499499< immutable empty digraph with 2 vertices>
500- gap> UnweightedBellmanFord(gr,2 );
500+ gap> UnweightedBellmanFord(gr, 2 );
501501[ [ fail , 0 ] , [ fail , fail ] ]
502- gap> gr := Digraph([[ 1 ] ,[ 2 ] ,[ 3 ] ,[ 4 ]] );
502+ gap> gr := Digraph([[ 1 ] , [ 2 ] , [ 3 ] , [ 4 ]] );
503503< immutable digraph with 4 vertices, 4 edges>
504- gap> UnweightedBellmanFord(gr,2 );
504+ gap> UnweightedBellmanFord(gr, 2 );
505505[ [ fail , 0 , fail , fail ] , [ fail , fail , fail , fail ] ]
506506
507507# OutNeighbours and InNeighbours
0 commit comments