The Josephus problem considers n people arranged in a circle, eliminating one person after skipping another, until only one remains. This study modifies the rule by letting the number of skipped individuals vary according to a permutation. Recording the elimination order yields a new permutation, which we define as the Josephus correspondence between the two. We investigate these correspondences among all permutations through directed graphs, highlighting their quantitative and combinatorial properties.