CMSC-341, Spring 1999, Sections 101 and 201

Lecture Synopsis

22. Graphs

[Previous Lecture] [Next Lecture]

Directed Acyclic Graphs (DAG)
Partial Ordering Relationship
Definition of Toplogical Ordering (Sort)
Characteristics of "greedy" algorithms
Greedy algorithm for Toplogical Sort
Demonstration of algorithm

[Previous Lecture] [Next Lecture]

Last modified on Thursday April 22, 1999 (17:58:02 EDT) by Alan Baumgarten
email: abaumg1@cs.umbc.edu

Back up to Spring 1999 CMSC-341 Section 1 and 2 Homepage