Çiçek Çavdar

March 12th 2010

Graphs- Exercise 3.3

Directed Acyclic Graphs

Computing Topological Ordering

Computing Topological Ord. Look for nodes with no incoming edges

Question

Solution

Solution cont’d

Homework

Graphs- Execise 3.7

Translate the question

Solution

Solution cont’d