Python Program for Graph Coloring Problem

graph_coloring.py

colors = ['Red', 'Blue', 'Green', 'Yellow', 'Black']

states = ['Andhra', 'Karnataka', 'TamilNadu', 'Kerala']

neighbors = {}
neighbors['Andhra'] = ['Karnataka', 'TamilNadu']
neighbors['Karnataka'] = ['Andhra', 'TamilNadu', 'Kerala']
neighbors['TamilNadu'] = ['Andhra', 'Karnataka', 'Kerala']
neighbors['Kerala'] = ['Karnataka', 'TamilNadu']

colors_of_states = {}

def promising(state, color):
    for neighbor in neighbors.get(state): 
        color_of_neighbor = colors_of_states.get(neighbor)
        if color_of_neighbor == color:
            return False

    return True

def get_color_for_state(state):
    for color in colors:
        if promising(state, color):
            return color

def main():
    for state in states:
        colors_of_states[state] = get_color_for_state(state)

    print colors_of_states


main()

If I have understood correctly, it is greedy algorithm (not exact algorithm), isn't it?

Extraordinary effort!

It saves huge amount of time for solving Super Graph Coloring problem for my algorithm graduate course project. I have modified this code for solving my problem. Big thanks for this code writer. I expect more contribution from him for solving different complex algorithmic problems, specially in python and share those solutions on GitHub.

Thanks you bro!!! I consulted this algorithm for my new project. Thanks from Dominican Republic

It does not provide correct output all the time.

Extraordinary effort!

It saves huge amount of time for solving Super Graph Coloring problem for my algorithm graduate course project. I have modified this code for solving my problem. Big thanks for this code writer. I expect more contribution from him for solving different complex algorithmic problems, specially in python and share those solutions on GitHub.

can i get that code.

how to relate this with hill climbing algo?

It does not provide correct output all the time.

agree, good but inefficient