<commit_before>public class KruskalMST {
  private final Queue<Edge> spanningTree = new Queue<Edge>();

  public KruskalMST(EdgeWeightedGraph G) {
    MinPQ<Edge> queue = new MinPQ<Edge>();

    for (Edge e : G.edges()) {
      queue.insert(e);
    }

    UF unionFind = new UF(G.V());

    while(!queue.isEmpty() && spanningTree.size() < G.V() - 1) {
      Edge edge = queue.delMin();
      int v = edge.either(),
          w = edge.other(v);

      if (!unionFind.connected(v, w)) {
        unionFind.union(v, w);
        spanningTree.enqueue(edge);
      }
    }
  }

  public Iterable<Edge> edges() {
    return spanningTree;
  }<commit_msg>[Algorithms] Small coding standards fix<commit_after>public class KruskalMST {
  private final Queue<Edge> spanningTree = new Queue<Edge>();

  public KruskalMST(EdgeWeightedGraph G) {
    MinPQ<Edge> queue = new MinPQ<Edge>();

    for (Edge e : G.edges()) {
      queue.insert(e);
    }

    UF unionFind = new UF(G.V());

    while(!queue.isEmpty() && spanningTree.size() < G.V() - 1) {
      Edge edge = queue.delMin();

      int v = edge.either(),
          w = edge.other(v);

      if (!unionFind.connected(v, w)) {
        unionFind.union(v, w);
        spanningTree.enqueue(edge);
      }
    }
  }

  public Iterable<Edge> edges() {
    return spanningTree;
  }
{'fraction_non_alphanumeric': 0.1548974943052392, 'fraction_numerical': 0.0015186028853454822, 'mean_word_length': 2.5815217391304346, 'pattern_counts': {'":': 0, '<': 15, '<?xml version=': 0, '>': 13, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3745991', 'n_tokens_mistral': 475, 'n_tokens_neox': 445, 'n_words': 100}