  Weakly distance-regular digraphs are a natural directed version of
distance-regular graphs. In [16], we classified all commutative weakly
distance-regular digraphs whose underlying graphs are Hamming graphs, folded
n-cubes, or Doob graphs. In this paper, we classify all commutative weakly
distance-regular digraphs whose underlying graphs are Johnson graphs or folded
Johnson graphs.
