SOL Prep

Graph Theory

Virginia SOL DM.GT.5

Use algorithms to schedule tasks and determine minimum project time.

Study DM.GT.5 with SOL PrepBack to Discrete Mathematics

What students need to be able to do

  • Specify in a digraph the order in which tests are to be performed.
  • Identify the critical path to determine the earliest completion time (minimum project time).
  • Use the list-processing algorithm to determine an optimal schedule.
  • Create and test scheduling algorithms.