def find_next_vertex(G):
def find_smallest_color(G,i):
n = len(G.nodes())
def greedy(G):
n = len(G.nodes())
global kmax
global visited_counter
print()
for i in G.nodes():
print('vertex', i, ': color', G.node[i]['color'])
print()
print('The number of colors that Greedy computed is:', kmax)
print()
print('Graph G1:')
G=graph1.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G2:')
G=graph2.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G3:')
G=graph3.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G4:')
G=graph4.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G5:')
G=graph5.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print()
for i in G.nodes():
print('vertex', i, ': color', G.node[i]['color'])
print()
print('The number of colors that Greedy computed is:', kmax)
print()
print('Graph G1:')
G=graph1.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G2:')
G=graph2.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G3:')
G=graph3.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
greedy(G)
print('Graph G4:')
G=graph4.Graph()
G.add_nodes_from(G.nodes(), visited = 'no')
color_count = 0
colored = 0
recursion(G,1)
if color_count == 0:
print('The graph is not ' + str(k) + '-colorable.')
print()
G1=graph1.Graph()
print('Graph G1:')
k = int(input("Please enter a value of k: "))
brute_force(G1,k)
print()
G2=graph2.Graph()
print('Graph G2:')
k = int(input("Please enter a value of k: "))
brute_force(G2,k)
print()
G3=graph3.Graph()
print('Graph G3:')
k = int(input("Please enter a value of k: "))
brute_force(G3,k)
print()
G4=graph4.Graph()
print('Graph G4:')
