100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
CO2412 Computational Thinking Lecture 11 CA$6.40
Add to cart
Quickly navigate to
Preview
  2.  
  3. University Of Central Lancashire Preston (UClan)
  4.  
  5. Computational Thinking (CO2412)

Class notes

CO2412 Computational Thinking Lecture 11
 0 purchase
  • Course
  • Computational Thinking (CO2412)
  • Institution
  • University Of Central Lancashire Preston (UClan)

This document contains detailed notes from Lecture 11 of the CO2412 course on Computational Thinking. The lecture focuses on graph traversal, a fundamental concept in computer science that involves visiting and updating each vertex in a graph. The notes cover the two primary methods of graph traver...

[Show more]

Preview 1 out of 4  pages

Document information

  • August 20, 2024
  • 4
  • 2023/2024
  • Class notes
  • Amin amini
  • All classes

Subjects

  • computer science
  • computational
  • python
  • algorithms
  • university
  • computer
  • 2nd year
  • efficiency
  • lecture
  • cs
  • notes

Written for

  • University of Central Lancashire Preston (UClan)
  • Unknown
  • Computational Thinking (CO2412)
All documents for this subject (19)

Seller

avatar-seller
BpoBpo

Reviews received

Content preview

CO2412: Computational Thinking
Lecture 11

Introduction to Graph Traversal
1. Graph Traversal Basics
o Graph traversal refers to the process of visiting, checking, and
updating each vertex in a graph.
o Two primary methods of traversal are:

 Breadth-First Search (BFS)
 Depth-First Search (DFS)
2. Importance of Graph Traversal
o Graph traversal is critical in solving many computational problems
such as searching for a path, exploring all possible configurations,
and more.


Breadth-First Search (BFS)
1. What is BFS?
o BFS is a graph traversal method that explores all vertices at the
present depth level before moving on to vertices at the next depth
level.
o BFS uses a queue data structure to keep track of vertices to be
explored.
2. BFS Algorithm
o Step-by-Step Process:

1. Start at the root (or any arbitrary node) and mark it as
visited.
2. Add the starting node to a queue.
3. While the queue is not empty:
 Dequeue a node and explore its neighbors.
 If a neighbor has not been visited, mark it as visited
and enqueue it.
4. Repeat until all nodes at the current depth level have been
explored.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller BpoBpo. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for CA$6.40. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

69052 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 15 years now

Start selling
CA$6.40
  • (0)
Add to cart
Added