The model is being treated as a graph induction problem, i.e. how to make a graph given the input. In graph theory, there are two main parts of a graph: nodes (points) and edges (what connects them). Here, nodes represent subtasks. The edges between the nodes represent temporal dependencies, which illustrate which tasks must be completed before another one is actionable. For example, you must create a guest list before you can send out invitations for a party. The graph is directed, which means it functions more like a flow chart instead of a plot of relations. The graph is induced from unstructured text found online, so it is a general and scalable approach.