Tutorial 4 - Data Structures '08
-
14
pages
-
English
-
Documents
Écrit par
Jonathan Cederberg <Jonathan.Cederberg@It.Uu.Se>
Publié par
Zawyug
-
14
pages
-
English
-
Documents
Description
Tutorial 4Data Structures ’08Jonathan Cederberg thFriday, October 10 , 2008OutlineExampleDFS vs. BFS1 ExampleAnotherExample2 DFS vs. BFS3 Another ExampleDS’08 Dept. of Information Technology - 2 - Jonathan Cederberg | jonathan.cederberg@it.uu.seOutlineExampleDFS vs. BFS1 ExampleAnotherExample2 DFS vs. BFS3 Another ExampleDS’08 Dept. of Information Technology - 3 - Jonathan Cederberg | jonathan.cederberg@it.uu.seExample exam questionExampleDFS vs. BFSAnother Prove or disprove:Examplen+1 nd) 2 =O(2 )e) lg(f (n)) =O(lg(g(n))) =) f (n) =O(g(n))f) max(f (n);g(n)) = (f (n) +g(n))DS’08 Dept. of Information Technology - 4 - Jonathan Cederberg | jonathan.cederberg@it.uu.seOutlineExampleDFS vs. BFS1 ExampleAnotherExample2 DFS vs. BFS3 Another ExampleDS’08 Dept. of Information Technology - 5 - Jonathan Cederberg | jonathan.cederberg@it.uu.seGraphs - what are they good for?Provide a good representation of...Example Data structures (linked lists, hash tables, trees)DFS vs. BFS The internetAnotherExample DNAA road networkA sewer systemThe circulation of your favorite bodily fluid...Google uses graphs! I use graphs!DS’08 Dept. of Information Technology - 6 - Jonathan Cederberg | jonathan.cederberg@it.uu.seWhether there is a path from every junction to all otherjunctions.And then?With the representation, we can isolate interesting properties ofExamplethe graph, and thus discover interesting properties ...
-
Publié par
-
Langue
English
Ajouté à mes notifications
Vous serez informé des prochaines publications.