code: public void visitOriginalEdges(int edgeId, int adjNode, boolean reverseOrder) {
          this.reverseOrder = reverseOrder;
          CHEdgeIteratorState edge = getEdge(edgeId, adjNode);
          if (edge == null) {
              throw new IllegalArgumentException("Edge with id: " + edgeId + " does not exist or does not touch node " + adjNode);
          }
          expandEdge(edge, false);
      }
docs: Finds an edge/shortcut with the given id and adjNode and calls the visitor for each original edge that is
  packed inside this shortcut (or if an original edge is given simply calls the visitor on it).
  
  @param reverseOrder if true the original edges will be traversed in reverse order