def GraphColoring(self, Edges):
    print(Edges)
    result = {}
    colors = ['red', 'blue', 'yellow', 'green', 'orange', 'springgreen', 'lime', 'olive', 'indigo', 'fuchsia']

    def SortEdges():
        sort_list = {}
        for key in Edges:
            sort_list[key] = len(Edges[key])
        sort2 = sorted(sort_list.items(),key=lambda x: x[1], reverse=True)

        return sort2

    def colorize():
        n = 0

        def removeColor():
            for color in colors:
                if color not in stackColor: return color
            color = colors[n+1]
            colors.append(color)
            return color

        for key in sort_list:
            stackColor = []
            for key2 in Edges[key[0]]:
                if key2 in result: stackColor.append(result[key2])
            color = removeColor()
            result[key[0]] = color
        return result

    sort_list = SortEdges()
    return colorize()