class_5_Graph_Traversals(3).pdf

# class_5_Graph_Traversals(3).pdf - Graph Traversals Graph...

• Notes
• 125

This preview shows pages 1–7. Sign up to view the full content.

Graph Traversals Graph Traversals BFS - Breadth-first search BFS - an application DFS - Depth First Search Topological sort Strongly connected component Graph Traversals July 15, 2017

This preview has intentionally blurred sections. Sign up to view the full version.

Graph Traversals Graph Traversals BFS - Breadth-first search BFS - an application DFS - Depth First Search Topological sort Strongly connected component Overview 1 Graph Traversals 2 BFS - Breadth-first search BFS - an application 3 DFS - Depth First Search Topological sort Strongly connected component
Graph Traversals Graph Traversals BFS - Breadth-first search BFS - an application DFS - Depth First Search Topological sort Strongly connected component Graph Traversals In many cases we are given a graph (directed or undirected) and we want to study some properties of the graph. In many cases this requires visiting all the nodes in the graph. Examples may vary from exploring the structure/topology of networks to implementing deadlock prevention algorithms and many other applications. We will see 2 such algorithms (and some applications of them): 1 BFS - Breadth-first search. 2 DFS - Depth-first search.

This preview has intentionally blurred sections. Sign up to view the full version.

Graph Traversals Graph Traversals BFS - Breadth-first search BFS - an application DFS - Depth First Search Topological sort Strongly connected component Graph Traversals In many cases we are given a graph (directed or undirected) and we want to study some properties of the graph. In many cases this requires visiting all the nodes in the graph. Examples may vary from exploring the structure/topology of networks to implementing deadlock prevention algorithms and many other applications. We will see 2 such algorithms (and some applications of them): 1 BFS - Breadth-first search. 2 DFS - Depth-first search.
Graph Traversals Graph Traversals BFS - Breadth-first search BFS - an application DFS - Depth First Search Topological sort Strongly connected component Graph Traversals In many cases we are given a graph (directed or undirected) and we want to study some properties of the graph. In many cases this requires visiting all the nodes in the graph. Examples may vary from exploring the structure/topology of networks to implementing deadlock prevention algorithms and many other applications. We will see 2 such algorithms (and some applications of them): 1 BFS - Breadth-first search. 2 DFS - Depth-first search.

This preview has intentionally blurred sections. Sign up to view the full version.

Graph Traversals Graph Traversals BFS - Breadth-first search BFS - an application DFS - Depth First Search Topological sort Strongly connected component Graph Traversals In many cases we are given a graph (directed or undirected) and we want to study some properties of the graph. In many cases this requires visiting all the nodes in the graph. Examples may vary from exploring the structure/topology of networks to implementing deadlock prevention algorithms and many other applications.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern