Hi all,
I am struggling the question, please see attachments.
Thanks a lot
Devise an algorithm which, given a (directed) friendship graph (in the xkcd format), finds the optimal seating arrangement. Your algorithm should include the following:
a description of the required input format...