  We introduce orbital graphs and discuss some of their basic properties. Then
we focus on their usefulness for search algorithms for permutation groups,
including finding the intersection of groups and the stabilizer of sets in a
group.
