#!/usr/bin/env python
# coding: utf-8

# ## algorithm

# In[1]:


def find(data, i):
    if i != data[i]:
        data[i] = find(data, data[i])
    return data[i]


# In[2]:


def union(data, i, j):
    pi, pj = find(data, i), find(data, j)
    if pi != pj:
        data[pi] = pj


# In[3]:


def connected(data, i, j):
    return find(data, i) == find(data, j)


# ## run

# In[4]:


n = 10
data = [i for i in range(n)]
connections = [(0, 1), (1, 2), (0, 9), (5, 6), (6, 4), (5, 9)]

# union
for i, j in connections:
    union(data, i, j)

# find
for i in range(n):
    print('item', i, '-> component', find(data, i))


# In[ ]: