Lecture6 - Graphs and Network Flows IE411 Lecture 6 Dr Ted...

Info icon This preview shows pages 1–6. Sign up to view the full content.

Graphs and Network Flows IE411 Lecture 6 Dr. Ted Ralphs
Image of page 1

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

IE411 Lecture 6 1 References for Today’s Lecture Required reading Section 18.8 References AMO Sections 3.4 CLRS Chapter 22
Image of page 2
IE411 Lecture 6 2 General Graph Search Depth-first search is so called because the node selected in each step is a neighbor of the node that is farthest from the root (in the tree). This is convenient because it allows a simple recursive implementation. Could we search the graph in a different “order”?
Image of page 3

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

IE411 Lecture 6 3 General Search Algorithm This is what a more general search algorithm might look like. Input: Graph G = ( N, A ) and source node s N 1: Q ← { s } 2: while Q 6 = do 3: remove the “next” node v from Q 4: mark v 5: process v 6: for w A ( v ) do 7: process ( v, w ) 8: if w is not marked then 9: Q Q ∪ { w } 10: end if 11: end for 12: end while (Figure 9.1 from Papadimitriou and Steiglitz)
Image of page 4
IE411 Lecture 6 4 Search Algorithm The search proceeds differently depending on which element v is selected from Q on line 3 in each iteration.
Image of page 5

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

Image of page 6
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '14
  • TedRalphs
  • Graph Theory, A* search algorithm, Steiglitz, Dr. Ted Ralphs, general search algorithm

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    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.

    Student Picture

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

  • Left Quote Icon

    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.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    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.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern