MediumPython ProgrammingHigh School (11–12)High School (9–10)UndergraduateGeneralPython Going Further › Data StructuresConceptualPython-Coded

In the friends graph below, find by breadth-first search, on paper, the shortest path from Kabir to…

Contributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

In the friends graph below, find by breadth-first search, on paper, the shortest path from Kabir to Ana, and write the queue and the previous dictionary after each step.

The friends. Asha knows Ravi and Kabir. Ravi knows Asha, Meera and Kabir. Meera knows Ravi and Ana. Kabir knows Asha and Ravi. Ana knows Meera. The search looks at each person's friends in this order.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, compare your working with the solution.

← All Problems

← From the dictionary of friends in the lesson, write a function that gives the person with the most…A network has the links A to B, B to C, D to E, and F alone. →

More onPython Going Further › Data Structures

Discussion (0)

Loading…