Does the subway map graphing technique of placing overlapping lines adjacent to each other have a name? A while back I was graphing multiple time-series with d

Does the subway map graphing technique of placing overlapping lines adjacent to each other have a name? A while back I was graphing multiple time-series with discrete times and values, but I got frustrated by how illegible the overlapping sections were. I tried to find a subway-map-style algorithm to solve the issue, but didn’t really know what to search for. I imagine the algorithm itself is relatively complex. Minimizing the number of crossovers is almost certainly NP hard.