Describe how to solve the following scheduling problem by making it into a graph problem. Describe both what the graph looks like and how to use the graph to find the minimum time:

Given tasks T1, T2, , Tm which require times t1, t2, , tn to complete, and a set of constraints, each of the form Ti must be completed prior to the start of Tj , find the minimum time necessary to complete all tasks.