Skip to content

Instantly share code, notes, and snippets.

View kimurash's full-sized avatar
💪
Write Code Every Week

shunsei kimurash

💪
Write Code Every Week
View GitHub Profile
import java.io.IOException;
import java.util.StringTokenizer;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.fs.Path;
import org.apache.hadoop.io.IntWritable;
import org.apache.hadoop.io.Text;
import org.apache.hadoop.mapreduce.Job;
import org.apache.hadoop.mapreduce.Mapper;
import org.apache.hadoop.mapreduce.Reducer;
@kimurash
kimurash / kruskal.cpp
Last active May 14, 2025 14:44
Program to construct a Minimun Spanning Tree using Kruskal's algorithm.
#include <bits/stdc++.h>
#include <stdint.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
class Edge {
public: