Topological Sorts Exercises

   < Previous  Next >
  1. Given the list of directed edges below, draw the directed graph: 
    BIOL_2010  ->  BIOL_2020
BIOL_2010  ->  EXSC_3830
EXSC_3830  ->  EXSC_4230
EXSC_3830  ->  EXSC_4000
EXSC_3830  ->  EXSC_4240
EXSC_4000  ->  EXSC_4010
EXSC_4240  ->  EXSC_4260
  2. For this graph, determine the topological order. To find the next vertex that does not have a successor, iterate over vertices in the order that they appear in the input, starting at the top of the list each time.

Last Modified: