Goal: Write an HTTP service which accepts a graph of people where edges represen

Question

Goal:

Write an HTTP service which accepts a graph of people where edges represent friendship relationships. Return the suggested edges which would create direct friend relationships between two people who currently are at most one friend away – two people who are “friends of a friend” (FOAFs).

Problem:

Receive as input an array of friend relationships.

Return a set of arrays each representing a new suggested friend relationship.

Example input:

{ “inList” : [

                                             { “friends” : [ “Albert”, “Betty” ] },

{ “friends” : [ “Betty”, “Cathy” ] },

{ “friends” : [ “Cathy”, “Denis” ] },

{ “friends” : [ “Denis”, “Albert” ] },

{ “friends” : [ “Tony”, “Bruce” ] }

    ] }

Example output:      

{ “outList” : [ [ “Albert”, “Cathy” ] , [ “Betty”, “Denis” ] ] }

Do not duplicate the suggestions (in the example above, do not also suggest [ “Cathy”, “Albert” ]. If no new friend relationships can be suggested, return the empty array. { "outList" : [ ] }

Erroneous input (e.g. malformed JSON) should be handled gracefully.  

In java Preferably.

Explanation / Answer

The below code uses some JSON libraries and javax.ws.rs libraries and they have to be imported accordingly for the code to run without any errors.

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.