Ah. I understand now. Thanks. Dave
On Sep 13, 2:28 pm, sirpi <sirpi...@gmail.com> wrote: > On Sep 13, 7:27 pm, Dave <dave_and_da...@juno.com> wrote: > > > Suppose the graph consists of three nodes in a triangle. You number > > your starting node at level 1 and the other two at level 2. How do you > > proceed? > > If the three nodes are a triangle then in a *depth* search, there is > node 1 and one of the neighbors is number two and the neighbor of > number two is number three. So in this case you have numbers 1,2 and > 3. Similarly, in a complete graph with n vertexes you > label them from 1 to n. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
