Would it be a good idea for \^ for a digraph and a perm to mean OnDigraphs?

[wilfwilson]

Sometimes I think it would be nice if D ^ p for a digraph and a permutation gave the same as OnDigraphs(D, p);.

For instance, you'd be able to do things like this:

gap> D := CycleDigraph(5);
<immutable cycle digraph with 5 vertices>
gap> p := (1,5)(2,4);;
gap> D ^ p = DigraphReverse(D);
true

However, I haven't though this through fully, and it feels like the sort of thing that might have some unintended consequences (especially in relation to mutability)... does anyone have any thoughts?

My apologies if this is a duplicate, I'm sure I've talked about this idea with people before.