Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsGraph search algorithms

Graph traversal

Theory

Starting point

Report a typo

Given four groups of friends as below:

Anna - Bob - Charlie - Doe
Alice - John - Mark
Tim - Ellie - Dora - Kate - Guy
Lora - Nolan

Members of different groups don't know each other. We represent these groups as a graph where nodes are people and edges represent the friendship relation between them. Also, assume that friendships are always two-sided, i.e. if Anna is a friend of Bob, Bob is also a friend of Anna.

Suppose you would like to traverse the graph in order to find Kate. What starting node would be more appropriate for this traversal?

Select one option from the list
___

Create a free account to access the full topic