@@ -489,19 +489,19 @@ gap> DigraphShortestDistances(gr);
489
489
# UnweightedBellmanFord
490
490
gap> gr := Digraph([[ 1 , 2 ] , [ 3 ] , [ 1 , 2 ] , [ 4 ]] );
491
491
< immutable digraph with 4 vertices, 6 edges>
492
- gap> UnweightedBellmanFord(gr,2 );
492
+ gap> UnweightedBellmanFord(gr, 2 );
493
493
[ [ 2 , 0 , 1 , fail ] , [ 3 , fail , 2 , fail ] ]
494
494
gap> gr := CycleDigraph(IsMutableDigraph, 3 );
495
495
< mutable digraph with 3 vertices, 3 edges>
496
- gap> UnweightedBellmanFord(gr,3 );
496
+ gap> UnweightedBellmanFord(gr, 3 );
497
497
[ [ 1 , 2 , 0 ] , [ 3 , 1 , fail ] ]
498
- gap> gr := Digraph([[] ,[]] );
498
+ gap> gr := Digraph([[] , []] );
499
499
< immutable empty digraph with 2 vertices>
500
- gap> UnweightedBellmanFord(gr,2 );
500
+ gap> UnweightedBellmanFord(gr, 2 );
501
501
[ [ fail , 0 ] , [ fail , fail ] ]
502
- gap> gr := Digraph([[ 1 ] ,[ 2 ] ,[ 3 ] ,[ 4 ]] );
502
+ gap> gr := Digraph([[ 1 ] , [ 2 ] , [ 3 ] , [ 4 ]] );
503
503
< immutable digraph with 4 vertices, 4 edges>
504
- gap> UnweightedBellmanFord(gr,2 );
504
+ gap> UnweightedBellmanFord(gr, 2 );
505
505
[ [ fail , 0 , fail , fail ] , [ fail , fail , fail , fail ] ]
506
506
507
507
# OutNeighbours and InNeighbours
0 commit comments