Steps to build a breadth first search implementation using adjacency matrix

1. Create minimal program with struct definition for graph and read_input() 
   function.

2. Implement read_input() and print_input() to verify correctness.

3. Initialize color, distance, parent and queues as required in bfs().

4. Implement bfs() completely printing the newly accepted edges. Print the
   output returned by the bfs() function.