Social Network

I want an algorithm that will find closed loops for attached example. I will have a database as mentioned in the example with the four fields. The algorithm should go through the mentioned database and produce a closed loop(s) if found . I have shown an example of the close loop. Where the system should find this loop. Person 1 Hates Person 2 but Person 2 love Person 1. (this is one connection; for every hate there should be a love connection or vice versa). to continue to produce the loop now Person 2 Hates Person 3 but Person 3 Loves Person 2 (connection valid) so now we have a connection from Person 1 to Person 3. But we need to find a closed loop. So lets continue and search the database. Person 3 Hates Person 5 But Person 5 Loves Person 3 (connection valid) now Person 5 hates Person 4 but Person 4 loves Person 5 (connection valid) and Person 4 hates Person 1 and Person 1 Loves Person 4 (connection valid) And here we have a found a closed loop between 5 persons . I want the system to check for as many closed loops in the database and list them graphically if possible. And store the results in a separate table . There will be thousands of data in the table. I want the rights for the source code and which to modify & execute my self. I may ask for source code modification and will request a separate quote for this This is for a Project I am working on for a big data course