PYTHON OR C++ BFS GRAPH PROGRAM

Setup:

There are two types of professional wrestlers: Babyfaces (good guys) and Heels (bad guys). Between any pair of professional wrestlers, there may or may not be a rivalry. There are n wrestlers and a list of r pairs of rivalries.

Python or C++ implementation of the following pseudocode: Create a graph G where each vertex represents a wrestler and each edge represents a rivalry. The graph will contain n vertices and r edges. The program will perform as many breath-first-searches (BFSs) as needed to visit all vertices. Assign all wrestlers whose distance is even to be babyfaces Assign all wrestlers whose distance is odd to be heels. Check each edge to verify that it goes between a babyface and a heel.

Input: Input is read in from a file specified in the command line at run time. The file contains the number of wrestlers, n, followed by their names, the number of rivalries r and rivalries listed in pairs. Note: The file only contains one list of rivalries Output: Results are outputted to the terminal. Yes, if possible followed by a list of the Babyface wrestlers and a list of the Heels . No, if impossible. Sample Input file: 5 Ace Duke Jax Biggs Stone 6 Ace Duke Ace Biggs Jax Duke Stone Biggs Stone Duke Biggs Jax

Sample Output: Yes Babyfaces: Ace Jax Stone Heels: Biggs Duke

PLEASE DEVELOP TO ACCEPT A .TXT FILE!

THANK YOU!!!!