docs: def label_correcting_get_cycle(self, j, pred):
          '''
          API:
              label_correcting_get_cycle(self, labelled, pred)
          Description:
              In label correcting check cycle it is decided pred has a cycle and
              nodes in the cycle are labelled. We will create a list of nodes
              in the cycle using labelled and pred inputs.
          Pre:
              This method should be called from label_correcting_check_cycle(),
              unless you are sure about what you are doing.
          Input:
              j: Node that predecessor is recently updated. We know that it is
              in the cycle
              pred: Predecessor dictionary that contains a cycle
          Post:
              Returns a list of nodes that represents cycle. It is in
              [n_1, n_2, ..., n_k] form where the cycle has k nodes.
          '''
          cycle = []
          cycle.append(j)
          current = pred[j]
          while current!=j:
              cycle.append(current)
              current = pred[current]
          cycle.reverse()
          return cycle