Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-7479d7b7d-qlrfm Total loading time: 0 Render date: 2024-07-13T16:21:26.035Z Has data issue: false hasContentIssue false

6 - Shortest Paths and Breadth First Search

from Part III: - Graphs and Networks

Published online by Cambridge University Press:  19 August 2022

Benny Chor  and
Amir Rubinstein
Benny Chor
Affiliation:
Tel-Aviv University
Amir Rubinstein
Affiliation:
Tel-Aviv University
Get access

Summary

In this chapter, we introduce the notion of graph algorithms, which are basically algorithms working on graphs. There are many such algorithms, aimed at solving a wide range of problems. We will focus on one such problem – the shortest paths problem. This problem has several algorithms, under different constraints, that solve it. We will present the well-known breadth first search (BFS), algorithm that solves a simple version of that problem. This algorithm will be explained in detail and implemented in Python. We will conclude the chapter by mentioning additional common problems in graph theory.

Type
Chapter
Information
Computational Thinking for Life Scientists , pp. 113 - 122
Publisher: Cambridge University Press
Print publication year: 2022

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Further Reading

Joy, MP, Brock, A, Ingber, DE, Huang, S. “High-betweenness proteins in the yeast protein interaction network.” J Biomed Biotechnol. 2005.2 (2005): 96–103. doi:10.1155/JBB.2005.96.Google Scholar
Ma’ayan, A, Jenkins, SL, Neves, S, et al. “Formation of regulatory patterns during signal propagation in a Mammalian cellular network.” Science. 309.5737 (2005): 1078–1083. doi:10.1126/science.1108876.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×