6.042J | Fall 2005 | Undergraduate

Mathematics for Computer Science

Lecture Notes

Lecture 9: DAGs, Partial Orders, Scheduling

Description:

This resource discusses Normal Person?s graph, Computer Scientist?s graph, relations and graphs, graphical properties of relations, paths, path relations, reflexive transitive closure, prerequisite relation on classes, prerequisite graph, and Directed Acyclic Graph (DAG).

Resource Type:
Lecture Notes
pdf
700 kB
Lecture 9: DAGs, Partial Orders, Scheduling
Learning Resource Types
Exam Solutions
Exams
Lecture Notes
Problem Set Solutions
Problem Sets