We establish a correspondence among loops, regular permutation sets and directed graphs with a suitable edge colouring and characterize regular permutation sets and, respectively, colored graphs giving rise to the same loop, to isomorphic loops and to isotopic loops