Dear friends, I recently answered a query concerning the action of the automorphism group of the Petersen graph on its edges at stackexchange.com. The algorithm that I present is quite naive, but it does produce the desired result. I thought I would share it here because it makes a nice Maple programming exercise e.g. for a talented student at high school level. (I have always thought that Polya counting and permutation groups belong into the high school curriculum.) It makes extensive use of Maple's internal hash function for compound objects to efficiently compare them during the computation. It is quite interesting to observe how Maple does work hard for several minutes to do this computation and then comes up with the correct answer. (Obviously the core computation needs to be done only once.) Enjoy!
Best regards, Marko Riedel
If you come up with a better algorithm then please do share it at the stackexchange link.