from collections import deque

import random as rand

import math as math

# the dfault weight is 1 if not assigend but all the implementation is weighted

self.graph[u] = [[w, v]]

if not self.graph.get(v):

self.graph[v] = []

# handels if the input does not exist

def remove_pair(self, u, v):

if self.graph.get(u):

if len(stack) == 0:

return False

class Graph:

def __init__(self):

self.graph = {}

# check if se have reached the starting point

if len(stack) == 0:

return False