assume().that(graphIsMutable()).isTrue();

    addNode(N1);
    Set<Integer> successors = network.successors(N1);
    assertThrows(UnsupportedOperationException.class, () -> successors.add(N2));
    addEdge(N1, N2, E12);
    assertThat(successors).containsExactlyElementsIn(network.successors(N1));
  }

  @Test
  public void edges_containsOrderMismatch() {
    addEdge(N1, N2, E12);

    links = null;
    return result;
  }

  /*
   * For discussion of the safety of the following methods for operating on predecessors and
   * successors, see the comments near the end of CompactHashMap, noting that the methods here call
   * link(), which is defined at the end of this file.
   */

  private int getPredecessor(int entry) {

success.failure_url_delete_all = URL de fallo eliminada.
success.delete_file = Archivo {0} eliminado.
success.job_started = Trabajo {0} iniciado.
success.job_stopped = Trabajo {0} detenido.
success.upload_synonym_file = Archivo de sinónimos cargado.
success.upload_protwords_file = Archivo Protwords cargado.
success.upload_stopwords_file = Archivo de palabras vacías cargado.

  }

  private static final class NodeAndRemainingSuccessors<N> {
    final N node;

    /**
     * The successors left to be visited, or {@code null} if we just added this {@code
     * NodeAndRemainingSuccessors} instance to the stack. In the latter case, we'll compute the
     * successors if we determine that we need them after we've performed the initial processing of
     * the node.
     */

    return delegate().adjacentNodes(node);
  }

  @Override
  public Set<N> predecessors(N node) {
    return delegate().predecessors(node);
  }

  @Override
  public Set<N> successors(N node) {
    return delegate().successors(node);
  }

  @Override
  public int degree(N node) {
    return delegate().degree(node);
  }

  @Override
  public int inDegree(N node) {
    return delegate().inDegree(node);

success.upload_bad_word = 금칙어 파일을 업로드했습니다.
success.upload_mapping_file = 매핑 파일을 업로드했습니다.
success.send_testmail=테스트 메일을 보냈습니다.
success.job_log_delete_all=작업 로그를 삭제했습니다.
success.changed_password=비밀번호를 변경했습니다.
success.started_data_update=데이터 업데이트 프로세스를 시작했습니다.
success.reindex_started=다시 색인화를 시작했습니다.
success.bulk_process_started=대량 프로세스를 시작했습니다.
success.print_thread_dump=스레드 덤프를 로그 파일에 인쇄했습니다.
success.install_plugin=플러그인 {0}을(를) 설치하는 중입니다.

            if (next != null) {
              Iterator<? extends N> successors = successorFunction.successors(next).iterator();
              if (successors.hasNext()) {
                // BFS: horizon.addLast(successors)
                // Pre-order: horizon.addFirst(successors)
                order.insertInto(horizon, successors);
              }
              return next;
            }

    assume().that(graphIsMutable()).isTrue();

    addNode(N1);
    Set<Integer> successors = graph.successors(N1);
    assertThrows(UnsupportedOperationException.class, () -> successors.add(N2));
    putEdge(N1, N2);
    assertThat(graph.successors(N1)).containsExactlyElementsIn(successors);
  }

  @Override
  @Test
  public void incidentEdges_checkReturnedSetMutability() {

success.reindex_started=Yeniden indeksleme başlatıldı.
success.bulk_process_started=Toplu işlem başlatıldı.
success.print_thread_dump=İş parçacığı dökümü günlük dosyasına yazdırıldı.
success.install_plugin={0} eklentisi kuruluyor.
success.delete_plugin={0} eklentisi siliniyor.
success.upload_file_to_storage={0} yüklendi.
success.sso_logout=Oturumunuz kapatıldı.
success.update_storage_tags={0} etiketleri güncellendi.

success.failure_url_delete_all = Fout-URL's verwijderd.
success.delete_file = Bestand {0} verwijderd.
success.job_started = Taak {0} gestart.
success.job_stopped = Taak {0} gestopt.
success.upload_synonym_file = Synoniembestand geüpload.
success.upload_protwords_file = Protwords-bestand geüpload.
success.upload_stopwords_file = Stopwoordenbestand geüpload.
success.upload_stemmeroverride_file = Stemmer-overschrijvingsbestand geüpload.