Navigating Graphs

Navigating Graphs

Try them all

Explore one thoroughly

What do you do when you have many different options?

Phase 0.

Identify a

starting point $s$.

Phase 0.

Identify a

starting point $s$.

Phase 1.

Go to some friend of $s$.

Phase 1.

Go to some friend of $s$.

Phase 0.

Identify a

starting point $s$.

Phase k.

Go to some friend of* friend of friend of friend of ... $s$.

$\cdots$

*whom you have

not met yet!

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

$s$

$x$

$y$

$w$

$z$

[Backtrack, rinse and repeat.]

Maintain Visit Status

visited[s] = 1

//where s is the starting point

visited[u] = 0 

//for all other vertices u

find_unvisited_neighbor(v):

    if v has an unvisited neighbor:

        return w

    else:

        return -1

A Helper Function

x = find_unvisited_neighbor(current)

if(x > -1):

else: