question about alogorithms

1. write 3-page to discuss the methods to check the connectivity of the directed graph, and explain how to check if the directed graph is strongly connected or not
2. Write a smple program to check if the directed graph is connected. If it is, check the directed graph is strongly connected or not. You are required to submit the source code with the outcomes of the program. pls use c to program