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 10 Notes £3.48
Add to cart
Quickly navigate to
Preview
  2.  
  3. University Of Central Lancashire Preston (UClan)
  4.  
  5. Computational Thinking (CO2412)

Lecture notes

CO2412 Computational Thinking Lecture 10 Notes
 0 purchase

This document contains comprehensive notes from Lecture 10 of the CO2412 course on Computational Thinking. The lecture introduces the foundational concepts of Graph Theory, a crucial area in computer science for modeling and solving complex problems involving networks of connected objects.

Preview 1 out of 3  pages

Document information

  • August 20, 2024
  • 3
  • 2023/2024
  • Lecture notes
  • Amin amini
  • All classes

Subjects

Written for

All documents for this subject (19)

Seller

avatar-seller
BpoBpo

Reviews received

Content preview

CO2412: Computational Thinking
Lecture 10
Introduction to Graph Theory
1. What is a Graph?
o A Graph is a collection of nodes, called vertices, and edges that
connect pairs of vertices.
o Vertices: The points or nodes of the graph.

o Edges: The connections between vertices.

2. Applications of Graph Theory
o Graph theory has a wide range of applications including social
networks, computer networks, logistics, and scheduling problems.
Types of Graphs
1. Undirected vs. Directed Graphs
o Undirected Graph: A graph where the edges have no direction.
The edge (u, v) is identical to (v, u).
o Directed Graph (Digraph): A graph where each edge has a
direction, going from one vertex to another. The edge (u, v) is
different from (v, u).
2. Weighted vs. Unweighted Graphs
o Weighted Graph: A graph where each edge has an associated
weight or cost.
o Unweighted Graph: A graph where all edges are treated equally,
with no weights assigned.
3. Simple Graph vs. Multigraph
o Simple Graph: A graph with no loops (edges connected at both
ends to the same vertex) and no more than one edge between any
pair of vertices.
o Multigraph: A graph that may have multiple edges between the
same set of vertices.
4. Connected vs. Disconnected Graphs
o Connected Graph: A graph in which there is a path between every
pair of vertices.
o Disconnected Graph: A graph where some vertices are not
connected by paths.

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 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 £3.48. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

68175 documents were sold in the last 30 days

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

Start selling

Recently viewed by you

Exam (elaborations) ·

(0)

Nclex Hints to pass and exam guide
£3.48
  • (0)
Add to cart
Added