0
Ç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
Graphs
Upcoming SlideShare
Loading in...5
×

Graphs

317

Published on

Analysis of Algorithms, PS #2

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
317
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
5
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Transcript of "Graphs"

  1. 1. Çiçek Çavdar March 12th 2010
  2. 2. Graphs- Exercise 3.3
  3. 3. Directed Acyclic Graphs
  4. 4. Computing Topological Ordering
  5. 5. Computing Topological Ord.  Look for nodes with no incoming edges
  6. 6. Question
  7. 7. Solution
  8. 8. Solution cont’d
  9. 9. Homework
  10. 10. Graphs- Execise 3.7
  11. 11. Translate the question
  12. 12. Solution
  13. 13. Solution cont’d
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×