Improve methods for deciding vertex and arc transitivity

[markuspf]

A digraph is vertex transitive if its automorphism group acts transitively on its vertices, and it is arc transitive if its automorphism group acts transitively on its arcs.

This can be implemented trivially, but that involves computing the automorphism group of the graph.

There are further properties of graphs determined by the automorphism group which might be nice to have, and maybe some of the above properties can be (dis)proven using an algorithm that is more efficient than an automorphism group computation. (In which case I'd like to know said algorithm).

[wilfwilson]

I'll reopen this for now, since I don't think your issue has been fully resolved. Perhaps someone will want to make a bit more progress.