| Current Forum: 15-211 Main Forum |
| Date: Mon Dec 17 2001 9:57 pm |
| Author: White, David <white3@andrew.cmu.edu> |
| Subject: Topological Sort Q, FALL '00 |
|
|
I have another question.
ON the topological sort question of the fall '00 exam
it gives three graphs and we are to give all the possible
topological sorts.
For a) I got ABCD and ABDC
For b) I got SUVR
For c) I got none.
It's c where I'm nervous. I read in the book that if
a graph has a cycle there is no possible topological sort. Is
that right? I guess in the course scheduling analogy that is correct, so c must be none...
comments? |
|