Skip to content

Commit c32aca6

Browse files
committed
Changes made to SwapDigraphs and DigraphRemoveAllEdges
1 parent d2fe700 commit c32aca6

File tree

3 files changed

+0
-40
lines changed

3 files changed

+0
-40
lines changed

doc/oper.xml

Lines changed: 0 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -777,27 +777,6 @@ true
777777
</ManSection>
778778
<#/GAPDoc>
779779

780-
<#GAPDoc Label="DigraphRemoveAllEdges">
781-
<ManSection>
782-
<Oper Name="DigraphRemoveAllEdges" Arg="digraph"/>
783-
<Returns>An empty digraph.</Returns>
784-
<Description>
785-
This operation returns a digraph constructed from <A>digraph</A>, which is mutable,
786-
by removing all of the edges in the original digraph.
787-
(see <Ref Oper="DigraphRemoveEdge" Label="for a digraph and an edge"/>).
788-
<P/>
789-
790-
<Example><![CDATA[
791-
gap> D3 := Digraph(IsMutableDigraph, [[2], [1], [2]]);
792-
<mutable digraph with 3 vertices, 3 edges>
793-
gap> DigraphRemoveAllEdges(D3);
794-
<mutable empty digraph with 3 vertices>
795-
true
796-
]]></Example>
797-
</Description>
798-
</ManSection>
799-
<#/GAPDoc>
800-
801780
<#GAPDoc Label="InducedSubdigraph">
802781
<ManSection>
803782
<Oper Name="InducedSubdigraph" Arg="digraph, verts"/>

gap/oper.gd

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -29,8 +29,6 @@ DeclareOperation("DigraphRemoveEdge", [IsDigraph, IsPosInt, IsPosInt]);
2929
DeclareOperation("DigraphRemoveEdge", [IsDigraph, IsList]);
3030
DeclareOperation("DigraphRemoveEdges", [IsDigraph, IsList]);
3131

32-
DeclareOperation("DigraphRemoveAllEdges", [IsDigraph]);
33-
3432
DeclareOperation("DigraphReverseEdge", [IsDigraph, IsList]);
3533
DeclareOperation("DigraphReverseEdge", [IsDigraph, IsPosInt, IsPosInt]);
3634
DeclareOperation("DigraphReverseEdges", [IsDigraph, IsList]);

gap/oper.gi

Lines changed: 0 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -277,23 +277,6 @@ InstallMethod(DigraphRemoveEdges, "for an immutable digraph and a list",
277277
[IsImmutableDigraph, IsList],
278278
{D, edges} -> MakeImmutable(DigraphRemoveEdges(DigraphMutableCopy(D), edges)));
279279

280-
InstallMethod(DigraphRemoveAllEdges, "for a mutable digraph",
281-
[IsDigraph],
282-
function(D)
283-
local i, nbs, currentEdges;
284-
if IsImmutableDigraph(D) then
285-
ErrorNoReturn("Argument must be a mutable digraph");
286-
else
287-
nbs := OutNeighboursMutableCopy(D);
288-
for i in [1 .. Length(nbs)] do
289-
currentEdges := DigraphOutEdges(D, i);
290-
DigraphRemoveEdges(D, currentEdges);
291-
od;
292-
293-
return D;
294-
fi;
295-
end);
296-
297280
InstallMethod(DigraphReverseEdge,
298281
"for a mutable digraph by out-neighbours and two positive integers",
299282
[IsMutableDigraph and IsDigraphByOutNeighboursRep, IsPosInt, IsPosInt],

0 commit comments

Comments
 (0)