title: Table seating, what algorithm to use?
body: <p>So I have this problem and I need to figure out what kind of algorithm can solve it.</p>
  
  <p>Given a group of people, and given who doesn't like whom within this group, arrange a seating for all people at a round table so that no one sits next to someone they do not like (if possible).</p>
  
  <p>I just can't figure out how to approach it. Basically I drew it as a directed graph with nodes representing a person and edges going from people who doesn't like someone to the one they don't like. Then, you want to arrange the nodes in a circle so that no edge is between two nodes next to each other. I couldn't find an algorithm that solves this kind of problem however.</p>