#Description: Incomplete Code for SA403 Final. Examines whether or not a graph is connected, and returns a list of function times.
#Input: GG = Digraph
#Output: Graph_Connected: Integer value (1 = Connected, 2 = Not Connected)
# finish_time: vector of finish times for the SCC algorithm
# This code is modified from my submission for the Depth_First_Search algorithm. To note, my submission for the Depth_First_Search HW dependend on help I received from 2/C Shires. As a result, this submission has been assisted (indirecrtly) by 2/C Shires.
# "colors:" 0 = unvisited, 1 = currently visiting, 2 = have been visited