sori424

# get code from >>  https://debuglog.tistory.com/84

parent = {}
rank = {}

def make_set(v):
    parent[v] = v
    rank[v] = 0

def find(v):

sori424

class Graph():

    def __init__(self, size):
        self.size = size

    def printMST(self, parent):
        for i in range(self.size):
            print(parent[i],'-',i,'\t',self.graph[i][parent[i]])

    def minKey(self, key, mstSet):

sori424

from typing import List
from copy import deepcopy

class Graph:
    def __init__(self, size):
        self.size = size
        self.adj_matrix = [[float('inf')] * size for i in range(size)]


    def add_edge(self, i, j, weight):

sori424

def dijkstra(start, size, weight):

# one vertex's adjacent vertecies list : distance

    distance = weight[start]
    
  # if visit the vertex, check it as True
  
    visited = [False]*size
    

sori424

val = [60, 120, 100] 
wt = [10, 30, 20] 
W = 50

def binary_knapSack(W, wt, val):
    n = len(val)
    k = [[0 for _ in range(W+1)] for _ in range(n+1)]

    for i in range(n+1):
        for w in range(W+1):